In java please:

public class CSC300Program3a numUnique returns the number of unique values in an array of ints. * Precondition: the array may be empty, but if it is not empty the array is sorted from low to high. your solution can assume this is true Your solution must go through the array exactly once. Your solution must * not cali any other functions. Here are some examples (using """ * informally): * pre> numunique (new int [] numunique (new int [] { { }) 11 :: 1 }) = nunUnique (new int[] { 11, 11, 11, 11 }) 8 numunique (new int[] { 11, 11, 11, 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77, 88, 88 }) 8 == numunique (new int[] { 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77 , 88 }) *pre public static int numUnique (intl] list) return -1; //TODO1: fix this