The following information is given on a parallel algorithm: T(n, 1) T(n,p) = = n log n n log n + logn, p n Write the expression for speedup. What happens to the speedup if n is fixed and p is contin- ually increased? What happens to the speedup if the problem size n is kept proportional to p, the number of processors (i.e., n = kp for some constant k)? Comment on your answers.