Problem
1. Write a CREW PRAM algorithm for adding all n numbers in a list in Θ(lg n) time.
2. Write a CREW PRAM algorithm that uses n 2 processors to multiply two n × n matrices. Your algorithm should perform better than the standard Θ(n 3)-time serial algorithm.
3. Write a PRAM algorithm for Quicksort using n processors to sort a list of n elements.