adent Name: J#: Q7-15 pts) De (a) Write the pseudo code of the algorithm and justify that it is recursive and wo (b) Write the recurrence relation for the algorithm and solve in class, as appropriate. Solve the recurrence relation and show that the time complexity of the recursive algorithm is (n) rks correctly it using one of the two approaches discussed