How do you solve numbers 1-5 with a given figure. Please demonstrate using one of the figures with an explanation. Thank you.

3.2 For the task graphs given in Fiqure 3.42, determine the following: 1. Maximum degree of concurrency. 2. Critical path length. 3. Maximum achievable speedup over one process assuming that an arbitrarily large number of processes is available. 4. The minimum number of processes needed to obtain the maximum possible speedup. 5. The maximum achievable speedup if the number of processes is limited to (a) 2, (b) 4, and (c) 8. Figure 3.42. Task-dependency graphs for Problem 3.2