ARRAYS - CLUMPS Description: Write a java program where printed to the screen is the biggest "clump" that appears in an array. Lets say that a "clump" in an array is a series of 2 or more adjacent elements of the same value. The size of the array is decided by user input and the elements are also decided by user input. [1, 2, 2, 3, 4, 4] → 2 (Biggest Clump Size: 2) [1, 1, 2, 1, 1] → 2 (Biggest Clump Size: 2) [1, 1, 1, 1, 1] → 1 (Biggest Clump Size: 5) [3, 3, 3, 1, 1, 2, 4, 4, 4] → 3 (Biggest Clump Size: 3) Sample Input, (first integer is array size): 5, 3, 3, 4, 5, 5 Sample Output: Biggest Clump Size: 2