No code needed, pen and paper problem.

When a program is adapted to run on multiple processors in a multiprocessor system, the execution time on each processor is comprised of computing time and

the overhead time required for locked critical sections and$/$or to send data from one processor to another.

Assume a program requires $\backslash ($ t$=100\backslash$mathrm$\{$~s$\}\backslash )$ of execution time on one processor. When run $\backslash ($ p $\backslash )$ processors, each processor requires $\backslash ($ t $/$ p $\backslash$mathrm$\{$~s$\}\backslash ),$ as well as an additional $4$ s of overhead, irrespective of the number of processors. Compute the per$-$processor execution time for $\backslash (2,4,8,16,32,64\backslash ),$ and $128$ processors. For each case, list the corresponding speedup relative to a single processor and the ratio between actual speedup versus ideal speedup $($speedup if there was no overhead$).$