Question: Note that we have chosen the median of an n-element set to be the element in position n/2. We have also chosen to put the median of the medians into the set L of algorithm Select1. Show that this lets us prove that T(n) ≤ T(3n/4) + T(n/5) + cn for n ≥ 40 rather than n ≥ 60. (You will need to analyze the case where n/5is even and the case where it is odd separately.) Is 40 the least value possible?