Assume the communication network connecting the message passing multiprocessor system for solving the Sieve of Eratosthenes (using the data parallel approach taught in the class) supports concurrent message passing. Propose a faster method of communication which is better than lambda(p-1) (a) Describe the faster communication algorithm (b) Describe its time expression (c) Analyze the execution time and speedup on 1, 2, 3, ...., 16 processors of the new Sieve algorithm that will use your communication scheme, assuming n = 1,000,000 and lambda = 100X