You have the following list of integers: 50, 40, 30, 1, 2, 3. Show the operations of selection sort and bubble sort on these lists. The information you need to show is described below

Selection Sort	Bubble Sort
Outer loop index i Outer loop changer to variable min Inner loop index j Inner loop comparison result Inner loop changer to variable min Outer loop swap of A[i] and A[min]	Outer loop index i Inner loop index j Inner loop swap of A[j+1] and A[j] Inner loop comparison result

Count the total number of comparisons done by each algorithm and the total number of swaps. Do these total conform to the asymptotic bounds we established in class for the algorithms? What is the smallest number of element swaps that are required to put the list in sorted order (you can swap any two elements, but only one swap at a time)? How does this compare with the number of swaps actually performed by the two algorithms?