Need an answer ASAP

T-Mobile Wi-Fi 9:32 AM 85% Here we will implement another simple sorting algorithm in a method sort20) The method sort2) should use another method findMinPos), also to be implemented The idea of this sorting algorithm swap it with the first element of the array. with the second element of the array. with the third element of the array. 1. Find the smallest element in the array and 2. Find the second smallest element and swap it 3. Find the third smallest element and swap it ...until we go through all elements of the array public class Sorter20 This method returns am index of a position of the smallest element in array a between the start(inclusive) index and the end of the array e.g. findMinPos(arr, 0) will return the smallest element in the entire array and findMinPos(arr, 3) will return the smallest element in the array starting from index 3(inclusive)