This is C language coding question.

Consider a variant of quicksort called $k-$quicksort which chooses $k-1$ pivots at each

step. $($Note that the usual quicksort corresponds to $k=2).$

$($a$)(5$ points$)$ Write the pseuducode for a $k-$quicksort function that takes $k$ as a pa$-$

rameter and always chooses the first $k-1$ elements as pivots. If your pseudocode

uses a Partition function, make sure you implement that as well.

$($b$)(3$ points$)$ Draw the recursion tree for $k=3$ and arr$=[17,12,15,38,6,13].$

$($c$)(2$ points$)$ Use big$-$ notation to express the time complexity of $k-$quicksort in terms

of both $k$ and the length of the array $n.$