Please help write this in one method in the simplest way possible

(c) (9 points) A method to sort a 1-dimensional array Write a method called sortOneRow that takes as input a one dimensional array of integers. The method should not return any value. The method should sort the array in an increasing order. To do so, you must implement the following algorithm (called selection sort): Idea: consider the array as if it was divided into two parts, one sorted (on the left) and the other unsorted (on the right). Note that at the beginning the sorted part is empty. To implement Page 4 this idea, you need to keep track of where the sorted part ends and where the unsorted part begins. For instance, you can keep track of the first index of the unsorted part of the array Such index at the beginning will be 0 Find where the smallest element in the unsorted part of the array is positioned. Swap that element with the element in the initial position of the unsorted part of the array. Update the index indicating where the unsorted part of the array begins. Repeat the above steps until the entire array is sorted. Consider the following simple array: int[] x-(5, 3, 1, 4, 2); Let's apply the procedure described above step by step: 1. At the beginning, the sorted part of the array is empty, while the unsorted part goes from the . First let's find the smallest element in the unsorted part of the array. The elements in the . Then, let's swap the element 1 with the element in the initial position of the unsorted part element at index 0 to the element at index 4 unsorted part of the array are 5,3, 1,4,2], therefore the smallest is 1