In this problem, we will implement a simple sorting method that could sort an integer array. Write a

function named sortArray that accepts an int array, and sort the array in order. That is, the smallest

would be the 0th element, and the greatest would be the last element. The function header would appear

as

public static void sortArray (int[] inArr)

In particular, the sorting is carried out as follows:

Use a linear search and find the minimum element ranging from the 0th to the last element, swap

the 0th element with this minimum element.

Use a linear search and find the minimum element ranging from the 1st to the last element, swap

the 1st element with this minimum element.

Use a linear search and find the minimum element ranging from the 2nd to the last element,

swap the 2nd element with this minimum element.

.

Sue a linear search and find the minimum element ranging from the (arr.length-2)th (i.e., the

second to last element) to the last element, swap the (arr.length-2)th element with this minimum

element.

Hint: You would need a nested for loops to carry out the above procedure. The swap function from

part a) of problem 3 would be very useful to execute the swap.