Complete the method int getMaxRow(int[] a) to return the index of the "row" in the two-dimensional array a with the highest row sum. m is the sum of all the elements in a particular row.) For example, if a is the five row by four column array as shown: 1 1 1 2 0 2 2 3 3 2 2 1 2 1 1 0 Then 2 will be returned, because the sum of the elements in row index 2 (3, 2, 3, 3) is 11, which is higher than the row sum of any of the other rows in a. (The row 2

Implement getArrayElmsInRange Method Details: getArrayElemsInRange public static int[] getArrayElemsInRange​(int[] array, int lower, int upper) Returns an array with values in the range defined by lower (inclusive) and upper (inclusive). Feel free to use the getCountInRange method during the implementation of this method (See below). Parameters: array - integer array lower - lower limit upper - upper limit Returns: array with values in the range or empty array Throws: java.lang.IllegalArgumentException - if array is null or lower is greater than upper. Any error message is fine (e.g., "Invalid parameters(s)") getCountInRange Method: class Main {             // this function will return the number elements in the given range             public static int getCountInRange(int[] array, int lower, int upper)             {                         int count = 0; // to count the numbers                         // this loop will count the numbers in the range                         for (int i…

Given an array, find the next greater element for each element in the array, ifavailable. If not available, print the element itself. The next greater element y for anelement x in the array is the first element that is greater than x and occurs on its rightside. The next greater element of the right most element in an array is the elementitself.Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9].

Given an array arr of type int, along with two int variables i and j, write some code that swaps the values of arr[i] and arr[j]. Declare any additional variables as necessary.