In java

Consider the leftmost appearance of a value in an array and the rightmost appearance of that same value in the array We'll say that the span of this value is the number of items that exist between these two appearances including the two appearance) A value that appears only once in an array has a span of 1 Create the following method that return the subarray with the largest span found in arr. If roultiple subarrays have equally large spate, return the subarray with the largest rum. public static int[] maxSpan(int[] arr) Examples maxspan((1, 2, 1, 1, 3)) maxspan (1,4, 2, 1, 4, 1, 4)) (1, 2, 1, 1) (1, 2, 1,4, 1, 4) 1/ because (1, 4, 2, 1, 4, 1) has a smaller sum