Problem $16.$ Let T$($n$)$ be the number of comparisons that your algorithm performs on array A of

size n$.$ Derive a recurrence relation for T$($n$).$ Prove that T$($n$)=$ O$($n$).$

Problem $17.$ Suppose in the above solution instead of subdividing into groups of size $5,$ we divide

the array into groups of size $7.$ Derive and prove the recurrence for the runtime of this modified.