$3.($Problem $3\mathrm{.}2)$ For the task graphs given in above Figure, determine the following:

a$)$ Maximum degree of concurrency.

b$)$ Critical path length.

c$)$ Maximum achievable speedup over one process assuming that an arbitrarily large number of processes is available.

d$)$ The minimum number of processes needed to obtain the maximum possible speedup.

e$)$ The maximum achievable speedup if the number of processes is limited to $($a$)2,($b$)4,$ and $($c$)8.$