Amultiprocessor machine has 1024 processors. on this machine we map a computation in which n iterate values must be computed and then exchanged between the processors. values are broadcast on a bus after each iteration. each iteration proceeds in two phases. in the first phase each processor computes a subset of the n iterates. each processor is assigned the computation of k = n/p iterates, where p is the number of processors involved. in the second, communication phase each processor broadcasts its results to all other processors, one by one. every processor waits for the end of the communication phase before starting a new computation phase. let t c be the time to compute one iterate and let t b be the time to broadcast one value on the bus. we define the computation-to-communication ratio r as t c /t b . note that, when p = 1, no communication is required. at first, we use the premise of amdahl’s speedup (i. e., the same workload spread across an increasing number of processors). under these conditions: (a) compute the speedup as a function of p and r, for k = 1, 2, . . , 1024. (b) compute the maximum possible speedup as a function of p and r. (c) compute the minimum number of processors needed to reach a speedup greater than 1 as a function of p and r. second, we use the premise of gustafson’s law, namely that the uniprocessor workload grows with the number of processors so that the execution time on the multiprocessor is the same as that on the uniprocessor. assume that the uniprocessor workload computes 1024 iterates. (d) what should the size of the workload be (as a number of iterates) when p processors are used, as a function of p and r? pick the closest integer value for the number of iterates. (e) reconsider (a)–(c) above in the context of growing workload sizes, according to gustafson’s law. third, we now consider the overhead needed to broadcast values over the bus. because of software and bus protocol overheads, each bus transfer requires a fixed amount of time, independent of the size of the transfer. thus the time needed to broadcast k iterate values on the bus by each processor at the end of each iteration is now t 0 + k × t b . (f) using the constant workload size assumption (as in amdahl’s law), what is the maximum possible speedup? (g) using growing workload size assumption (as in gustafson’s law), what is the maximum possible speedup?