a. Design a recursive algorithm that each of the following equations can represent: 1. T(n)=T(n1)+n 2. T(n)=log(n)+n2 b. Design 3 scenarios and answer the following: 1. Find the solution to the problem 2. Find the recurrence relation to the algorithm 3. Draw the tree for the recurrence relation found in step 2 4. find the time complexity for the drawn tree in step 3