Please explain steps, thank you.

2. Consider the sorting algorithm shown below procedure sort a, ..., 9 : real numbers with n 2 2) for i:=1 to n-1 for j := to n-1 if a > 0+1 then interchange a and a-1 endif endfor endfor {Q2, ..., , is in increasing order) a) Give the big-o classification of the function: b) Consider the following list, where 66 is in position 1 of the list: 66, 22, 33, 11, 55, 44 Give the contents of the list after each of the first four passes used by the algorithm. Pass 1: Pass 2: Pass 3: Pass 4: c) Consider the following list, where 66 is in position 1 of the list: 66, 55, 44, 33, 22, 11 Give the contents of the list after each of the first four passes used by the algorithm. Pass 1: Pass 2: Pass 3: Pass 4