Perform a line-by-line analysis of Min(A). (a) What permutation of the input array results in the worst-case runtime? (b) Fill in the table above for the number of times the operation in each line of pseudo-code is executed in the worst case. Use the same convention on loops that is used in the analysis of INSERTION-SORT(A) (c) Express the worst-case runtime in asymptotic notation.

Pseudo-code MIN(A) cost times 1 n = length(A) c1 2 min = A(1) c2 3 for i=2 ton c3 4 if A(i)