Figure 1 below hints the arrangement as required for table. Row elements k1 k2 k3 k4 are always arranged in an increasing order automatically. Figure 1 Create and load an array named sums to the length of table to store the sum of elements of each row in table. Add a method countOccurrences() to the class such that the method takes an array int[] arr and a number int target for parameters, and it returns the number of occurrences of target in the arr array. Add a method findMaxIndex() to the class such that the method takes an array integral[] arr for parameter and it returns the index where the greatest element of arr is located. Create a 2-dimensional array named occurrences such that it has two rows and 49 columns. Load the different sum values of all quadruplets (that is, the numbers from 10 to 58) into the first row. Use countOccurrences() to determine the occurrences of each sum and load the return value into second row at the column of the given sum. Print the entire occurrences array to console in the 2-dimensional array format. Run the findMaxIndex() method on the row occurrences[1] to see which of the sums occurs the greatest number of times and print the results (index, the sum and the occurrences of the sum) to the console. Iterate over the sums array to find and to print to the console all the indices, where the array element is 34: in the printing, the index shall be followed by the corresponding row of the table. The beginning of the output should be as shown in Figure 2. Rows in the table where the sum is 34 Note that both of the added methods must be static. Each output displayed on the console must be accompanied by an adequate text explaining the result