in Java please

Improvement for 3-sum problem to NlogN. Write the problem with the following method header. (hint: using binary search) private static int[] sumThree(int[] input) { //write your code here and return a int array with three index, where the values sum to 0. // You only need to find one triple even if there are more than one