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

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

2. (10 pts) T (n) = 7T(n/8) + ; T(1) c. Determine the polynomial T(n) for the recursive algorithm characterized by these two recurrence relations, using the Recursion Tree Method Drawing the recursion tree may help but you do not have to show the tree in your answer; in- stead, fill the table below. You will need to use the following results, where and b are constants and x