The following question is about Computer Algorithms. Please solve it correctly.

Please make sure your answer is Complete and Correct, ask me anything if you need any more information,Thanks!!!!

3. (11 points) Use the substitution method to prove the guess that is indeed correct when T(n) is defined by the following recurrence relations: T(n) = 3T(n/3) + 5; T(1-5. At the end of your proof state the value of constant c that is needed to make the proof work Statement of what you have to prove: Base Case proof: Inductive Hypotheses: Inductive Step: Value of c