3. [15 marks] Imagine that in the linear order statistic finding algorithm (algorithm SELECT) we use groups of size 9 instead of 5. Analyze each 4 steps of the algorithm and obtain a new recurrence for the algorithm. Note: To check that your recurrence is correct you should be able to prove using substitution method that T(n) - O(n) just like problem 2 here. However, use this for your own verification and do not include the proof in your answer. [10 marks] Java's hashCode method returns an integer value for any given object. Assume that we are using the following implementation of hashCode for strings of lowercase and uppercase letters 4. public int hashCode) int hash -0 for (int = 0; i