When parallelizing an application, the ideal speedup is speeding up by the number of processors. this is limited by two things: percentage of the application that can be parallelized and the cost of communication. amdahl’s law takes into account the former but not the latter. a. [10] < 1.10> what is the speedup with n processors if 80% of the application is parallelizable, ignoring the cost of communication? b. [20] < 1.10> what is the speedup with 8 processors if, for every processor added, the communication overhead is 0.5% of the original execution time. c. [20] < 1.10> what is the speedup with 8 processors if, for every time the number of processors is doubled, the communication overhead is increased by 0.5% of the original execution time?