a) Argue the correctness of the algorithm by induction

b) Argue that for the number of comparisons among elements t(n) we have....

c) tabulate the values for n=1..200 in increments of 20

1) Consider the following sorting algorithm: function slowsort (A,left,right) if (left A[rightl exchange (A[center],A[right]); slowsort (A,left a) Argue the correctness of the algorithm by induction. b) Argue that for the number of comparisons among elements t(n) we have t(0) 0, t(1) 0, t(n) t(n/2)+t(n/21)+t-1) +1. c) Tabulate the values for n = 1 200 in increments of 20. 1) Consider the following sorting algorithm: function slowsort (A,left,right) if (left A[rightl exchange (A[center],A[right]); slowsort (A,left a) Argue the correctness of the algorithm by induction. b) Argue that for the number of comparisons among elements t(n) we have t(0) 0, t(1) 0, t(n) t(n/2)+t(n/21)+t-1) +1. c) Tabulate the values for n = 1 200 in increments of 20