1a)

What is the worst case size of S_L and S_R (in terms of n) when you divide a list of unsorted items of size n into groups of (2*5)+1 while selecting a pivot?

Input your answer as a decimal to three places. E.g. 3n/8 would be 0.375

1b)

What is the recurrence relation of the Deterministic Selection algorithm using the group size specified in part a?