Problem
1. Write a recursive Θ(n lg n) algorithm whose parameters are three integers x, n, and p, and which computes the remainder when x n is divided by p. For simplicity, you may assume that n is a power of 2-that is, that n = 2 k for some positive integer k.
2. Use the divide-and-conquer approach to write a recursive algorithm that finds the maximum sum in any contiguous sub list of a given list of n real values. Analyze your algorithm, and show the results in order notation.