Analysis Divide & Conquer: Analyze the complexity of algorithm A2 which solves a problem of size n by recursively solving six sub-program of size n/6 and combines in O(n3) time. Determine the recurrence and whether it is Subtract and Conquer or Divide and Conquer type of problem, and then solve it to big O notation. Use the master theorem to solve, state which theorem you are using and why and show step-by-step work. In the answer you must explain how you obtained the recurrence from the problem description and how you solved step by using one of the master theorems.