1. Given the speedup factor ts/tp = n-1/(n/m + m-1) of partitioning a list of numbers into m partitions that are added separately, show that the optimum value for m to give the minimum parallel execution time is when m = sqrt(p/(1 + tstartup), where there are p processors. Hint: Find the first and second order derivative of the speedup with respect to m. (5m)