write me a java code

Individual Exercise (Lab Homework) The method given on the upper right performs selection sort to sort a given array as an input argument in increasing order. It finds the smallest element in the array and swaps it with the first element. Then, it finds the smallest element in the remaining (unsorted) part of the array and swaps it with the first element of this remaining part. This process goes on until only a single number remains. Click heret for an animation of the selection sort algorithm. a Write the body of the sort method in the given template code (Lab7HomeworkTemplate.java) by modifving the selection sort alqorithm such that it can sort a given 2-D array as an input argument based on the following rules. The rows in the array are sorted in increasing order based on the first value in each row. The rows with the same first value are sorted in increasing order based on the second value in each row. public static void array) { for (int < array. length // find the minimum in the array[i... array. length-I] int currentMin = array[i]; int currentMinIndex = i; for (int j = array. length; j++) { if (currentMin array[j] > currentMin = array[j]; currentMinIndex = j // swap array[i] with array[currentMinIndex] if (currentMinIndex array [currentMinIndex] array C i]; array[i] = currentMin ; Before Sorting: 2], [1, 7], [2, 5], [1, 2], [3, 1], [4, 1], [5, 4]] After sorting: 2], [1, 7], [2, 5], [3, 1], [4, 1], [4, 2], [5, 4]] The console output of the final program is given on the right. DO NOT FORGET TO UPLOAD YOUR CODE AND VIDEO TO BLACKBOARD