In the algorithm SELECT $($using median of median

as a pivot value$)$ discussed in the class we created $5$ groups and showed

that you can make ith selection in O$($n$)$ in the worst case.

$($a$)$ What will happen to the complexity of SELECT algorithm $($dis$-$

cussed in chapter$-9)$ if we create $9$ groups instead of $5?$ Show all

your work$/$steps$.$

$($b$)$ Show that if you create $3$ groups then algorithm will no longer

be linear.