1. (5 points) The following information is given on a parallel algorithm: Serial execution time Parallel execution time Memory required per processor = n + pn = (a) Find the largest number of processors (as a function of n) that can be used while being optimally efficient. (3 points) (b) Assuming that memory available per processor is fixed, can we scale the number of processors as a function of n according to the equation derived above? (2 points)