STUDY PROBLEM 9 What is the recursion equation for the running time of SelectionSort? Find the running time from that equation using substitution method. STUDY PROBLEM 10 Use the recursion tree method and find out the solution (T(n) = O(?)) for the following recurrence equation: T( n)=T(n-1 ) + 3n+ 1 STUDY PROBLEM 11 Use the substitution method to show that for the recurrence equation: 19 T(n)=T( 3n/4 ) + n/4 the solution is T(n)=O(n)