Insertion/Selection/Quick Sorts In total n integers ranging from 0 to n − 1 are stored
randomly in A, an array of size n. You are supposed to implement the following four candidate sorting algorithms to sort A: Insertion Sort, Selection Sort, and Quick Sort (At each
recursion, you will have to choose the first element in the array as the pivot element). Note that, important, you have to work directly on the given starter [login to view URL]
the starter code from the course web site. Read the starter code and make sure you understand how it works before attempting to modify it. Design modifications to the starter code
for the methods that described in the Introduction section. Update the starter code with your
modifications. Run the code and your simulation. Submit 1) a printout of any file that you
modified or added to the starter code; 2) a printout of the output from your simulation. Note
that running [login to view URL] with your implementation, an example output is from 1-00 and then randomly sorted and after sort in right order from 1-99.