Please anwser question c d and e

Consider a program with the following characteristics:

$T_{\text{S}\text{e}\text{r}\text{i}\text{a}\text{l}}=20n^2+C$

$T_{\text{P}\text{a}\text{r}\text{a}\text{l}\text{l}\text{e}\text{l}}=\frac{20n^2}{p}+C+D$

$C=100$

$D=10lo{g}_{2}p$

a$)$ Does the term C result from non$-$parallelizable code or from parallelization overhead?

b$)$ Does the term $D$ result from non$-$parallelizable code or from parallelization overhead?

c$)$ Compute the speedup and efficiency of the program for $n=2^0,2^1$dots$2^8$ and $p=2^0,2^1$dots$2^8.$

Display that data in a table $($or tables$).($Writing a short program should be more efficient

than hand calculating $162$ values.$)$

d$)$ Is the program strongly scalable? Is it weakly scalable?

e$)$ Repeat questions $1($c$)$ and $1($d$)$ for $C=100$ and $D=100p$

Pleape