Answer with good high level explanation please

a$)$ Program $P$ is made up of two parts A and B$.$ Part A must be executed before part B$.$

The purely sequential Part A takes $822ms$ to execute on a single core and can't be

subdivided. Part B consists of $16$ independent indivisible tasks each of which takes $924$

$ms$ to execute on a single core. When executing part B on a $16-$core system, the $16$ tasks

can be executed in parallel.

Amdahl's law as it relates to multiprocessor systems was covered in module $12.$

What speedup does Amdahl's law predict for program P executing on a $16-$core system

compared to executing program $P$ on a single core system? Express your answer to two

decimal places.

b$)$ Gustafson's law was covered on module $12$ example set $4$ and in problem set $12.$

Suppose program $P$ is expanded so that it contains part A plus $16$ copies of part B$.$ What

speedup does Gustafson's law predict for this expanded program? Express your answer to

two decimal places.