(a) What is the execution time speedup of approach 2 compared to approach 1? (b) What is the execution time speedup of approach 3 compared to approach 1? (c) If programming, compiling, and execution time are all considered, what is the overall speedup of approach 2 compared to approach 1? (d) If programming, compiling, and execution time are all considered, what is the overall speedup of approach 3 compared to approach 1? (e) If the program is executed for 1000 times with 1000 different data sets, what is the speedup of approach 3 compared to approach 1? Please consider programming, compiling and all executions.

Programmers are debating about what is the best way to write a program. The three options are: 1. Create a standard, sequential C program and run it on a uniprocessor workstation 2. Create a standard, sequential C program and compile it using a parallelizing compiler, and run it on a 4-way shared memory multiprocessor. 3. Hand-parallelize the problem and run it on a 16-processor shared memory multiprocessor Consider the table: | Approach Time to Write Program | Time to Compile Program 2 hours 1 second 2 hours 5 minutes 4 hours 5 seconds Time to Execute Program 1 hour 15 minutes 5 minutes CON