solve

oT Sort. Here is the pseudocode: . The following is some experimental analysis of the average-case time requirements of Bubble for i = 0 to n-2 inclusive: for j = 0 to n-i-2 inclusive: if ALj] ALj+1]: swap A[j] and A[j+t1] end if end for end for Suppose the if statement takes 1 second to check, the swap line takes 1 second, and nothing else takes any time at all. (a) There are essentially only two lists of length 2. How much time does it take to sort each of them and what is the average time? List Time [1,2] [2, 1] Average Time = (b) There are essentially only six lists of length 3. How much time does it take to sort each of them and what is the average time? List Time Average Time = (c) The average time for a list of length 4 is 9 seconds and for a list of length 5 is 15 seconds. Plot the graph of average time as a function of list length for lengths 2, 3, 4,5. Solution: 15 +