The numbers written on the nodes of tree represent node number.

Analyze the following task-interaction graph and calculate: (i) The maximum degree of concurrency (ii) Critical Path Length (iii) Maximum possible speedup assuming large number of process are available (iv) Minimum number of processes needed to obtain the maximum possible speedup (v) Maximum speedup if number of processes are limited to 4