Need Help with Sorting Algorithms Tracing!!

I DO NOT need the code, I just need you to trace and show the steps of the problem! Please do NOT give me code, I just need help tracing it. there should be 8 answers? Show me the table just like below please! Thank you so much in advance!

3 Sorting Algorithm Tracing (20 points) 3.1 Selection, Insertion and Quick Sort For this section, you will be tracing various sorting algorithms and examining how the input affects the runtime. You will record your answers in HW2Part3.pdf. This set of sorting algorithms are in-place, and include overhead due to swapping. You will be keeping track of the total number of swaps that occur during the algorithm, as this is also a good measure of performance. For each input array, show the resulting array after each step of the algorithm in a neat table format. You will be tracing the following algorithms: 1. Selection Sort (MinSort) 2. Insertion Sort 3. Quick Sort (Trace unsorted case ONLY!!). Use zybooks partitioning algorithm You will be sorting the following arrays in ASCENDING order: a. Unsorted: [5, 9, 1, 2, 11, 7,3) b. Reversed: 11, 9, 7, 5, 3, 2,1 c. Almost Sorted: [2, 3, 5,9, 7, 11,1 d. Already Sorted:,2, 3, 5,7,9, 11 As an example, the first problem is provided for you. Continue o do the remaining 8. la. Selection Sort on Unsorted: Num f Sw teration 0 1,9, 5, 2, 11, 7,3 1, 2,3,9, 11, 7,5 1, 2,3, 5, 11, 7,9 1, 2,3, 5, 7, 11, 9 11, 2, 3,5, 7,9, 11