1. Suppose the sequential part of a program accounts for one third of the program's execution time on a single processor. Find a limit for the overall speedup that can be achieved by running the program on a multiprocessor machine. 2. Now suppose the sequential part accounts for 10% of the program's computation time. Let sn be the program's speedup on n processors, assuming the rest of the program is perfectly parallelizable. Your boss tells you to increase the speedup by a factor of 1.25: the revised program should have a speedup s'n > sn*1.25. You advertise for a programmer to replace the sequential part with an improved version that runs k times faster. What value of k should you require