Implement an O(N) method named printPairs which takes in an input array and integer value K and then prints the pairs whose sum equal to K. You can assume an existing hash is given.e.g. Java Hash or Linear Probe Hash. Hint: (K=a+b b =K-a). (co3-4-5-6) Example is given below. int[] ar = {1, 2, 3, 6, 10, 7 }; int K = 9; printPairs (ar, K); // Outputs: Pairs whose sum is 9: Pairs: 2,7 Pairs: 3,6 Pairs: 3,6