For part b, I need the number of comparisons for each n value. slow sort code example with comparison counter please. Also please give an original solution, do not copy and paste other submissions.

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