Please give answers with detailed solutions$/$explanations:

For the task graphs given below, determine the following:

Maximum degree of concurrency.

Critical path length.

Maximum achievable speedup over one process assuming that an arbitrarily large number of

processes are available.

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

The maximum achievable speedup with $4$ threads.