Problem
1. Consider the problem of adding the numbers in a list of n numbers. If it takes ta (n - 1) time for one person to add all n numbers, is it possible for m people to compute the sum in less than [ta (n - 1)] /m time? Justify your answer.
2. Write a PRAM algorithm that runs in Θ((lg n) 2) time for the problem of merge sorting. (Hint: Use n processors, and assign each processor to a key to determine the position of the key in the final list by binary searching.)