Solve the following recurrence relations: 1. T(n)={T(n1)+51forn>1forn=0 2. T(n)={T(n/3)+11forn>1forn=1 Enter the result of the solved equations as a responseto below in the space provided BEFORE the deadline AND... To get any credit, you MUST solve these using the substitution method. and you must also show three iterations in addition to the kth iteration: just like I have done in class. You can write this out in pencil, take a picture and submit it as a .jpeg file. Make sure your handwritting is legible. if I can't read it, it's a zero. To be clear you are entering in the space provided below the response to the question (i.e., O(NLogN) AND you are emailing a.jpeg or .pdf file showing how you did it, i.e. showing three Iterations in addition to the kth iteration