1) (8 points, 4 points each): This question is about the Substitution Method, described in Section 4.3 of CLRS. We used the Substitution Method to prove that finding the Median of n elements can be done in the time that we guessed would work, O(n) We had a recurrence equation for T(n), the runtime for this algorithm (Slide 41 of Lecture 15) Since we guessed that the solution to that recurrence equation was O(n), we tried to find constants no and c such that for all n >= no, T(n) -no, T(n)