2.15 Pts] Divide and Conquer is an algorithm design technique where a larger problem is divided into smaller sub-problems and combine the solution of sub-problems to solve the bigger problem. Use the divide and conquer technique to solve the following problem. Fibonacci (N) if N-0 or N-1 else then f = 1 f = Fibonacci (N-1) + Fibonacci (N-2) a) Clearly indicate the divide, conquer, and combine steps b) Write the recurrence that gives the running time of your algorithm above (No need to solve the recurrence)