(6 MARKs) Consider the following three methods of solving a particular problem (input size n): 1. You divide the problem into three subproblems, each 3 the size of the original problem, solve each recursively, then combine the results in time linear in the original problem size. 2. You divide the probleln into 16 subprlelns, each of size of the original problem, solve each recursively, then combine the results in time quadratic in the original problem size. 3. You reduce the problem size by 1, solve the smaller problem recursively, then perform an extra "computation step" thai requires linear time. Assume the base case has size 1 for all three methods. For each method, write a recurrence capturing its worst case runtime. Which of the three methods yields the fastest asymptotic runtime? In your solution, you should use the Master Theorem wherever possible. In the case where the Master Theorem doesn't apply, clearly state why nol based on your recurrence, and show your work solving the recurrence using another method (no proofs required)