If you are using divide and conquer to solve the problems, then your solution must clearly and specify describe each of the following steps: . Dividing the problem into sub problems . Solving sub problems Merging solutions of sub problems. Then, you must derive a recurrence relation for the run-time of the algorithm, and solve the recurrence relation. In this PA, you may assume that n is a power of 2 (if it helps) There are 5 problems and each problem is worth 50 points