Question 2) (20 points) (a) (10 points) Draw the sorting network for 5 inputs that use the idea of the selection sort. (b) (5 points) Consider a sorting network design by using the idea of the selection sort as in part (a), but this time imagine the network designed for n input lines. Write down the recurrence for the number of comparators in this sorting network: C(n) =. (c) (5 points) Give an asymptotic tight bound for the solution of the recurrence in part (b). You can simply state the bound, you don't need to show your steps. Question 2) (20 points) (a) (10 points) Draw the sorting network for 5 inputs that use the idea of the selection sort. (b) (5 points) Consider a sorting network design by using the idea of the selection sort as in part (a), but this time imagine the network designed for n input lines. Write down the recurrence for the number of comparators in this sorting network: C(n) =. (c) (5 points) Give an asymptotic tight bound for the solution of the recurrence in part (b). You can simply state the bound, you don't need to show your steps