What is the complexity of algorithm A which solves a problem of size n by recursively solving three sub-programs of size n-4. To combine the solution it takes O(n 2 ) time. Determine the recurrence and then solve it to big O notation. Use master theorem to solve and show the work. In the comment you must explain how you obtained the recurrence from the problem description and how you solved it to big O notation using the theorem