I AM JUST LOOKING TO CHECK MY WORK I KNOW THIS IS MORE THAN ONE QUESTION ON A SINGLE QUESTION POST, BUT IT WOULD REALLY HELP ME REVIEW FOR MY TEST TODAY TO KNOW IF I GOT THE RIGHT ANSWERS! THANK YOU ALL FOR BEING A GREAT TEAM AND HELPING ME PASS THIS SYMESTER I AM JUST TRYING TO STAY AHEAD. THIS IS ALGORITHMS AND I COULD REALLY USE THIS TO CHECK MY WORK!!! THANKS FOR TAKING THE TIME TO READ THIS!!!!

1. Consider the following recurrence equation, defining T(n), as T(n) ={T(n-1)+2 If n=1 otherwise Show, by induction, that T(n)- 2n 2. Draw the recursion tree for T(n)( )+r() + (n) and find the height ofthe tree 3. Solve the following recurrence: T(n) + e(nIgn) 4. Solve the following recurrence. T (n)=sr()+ ) 5. Solve the following recurrence: T(n)=8T()+(n*) 6. Solve the following recurrence: T(n):ICI+17)+n