Question 1 Write a function that returns the maximum number of equal adjacent elements in an array. Your code should work in the case that the list is empty (returning 0). For example, in the array [4411555215531666416], the result should be four, since there are four adjacent 6s. That is more than the three adjacent 5s or the pair of adjacent 4s and 5s. Note that there are not five adjacent 6s, since 41 separates the first four from the last one. You can write iteratively or recursively, in any style. You may use only one loop or recursive helper function. public static int maxNumberOfAdjacentEqual(double[] a) \{