Given a sorted array of integer, A, with possible duplicate elements. Implement an efficient (SUBLINEAR running time complexity) function in Java to find in A, the numbers of occurrences of the input value k. For example, in an array A = {-1, 2, 3, 5, 6, 6, 6, 9, 10} and k = 6, your program should return 3.

Note: There is an emphasis on a sublinear solution. for a simple array. No need to show how it applies to matrices.