$2$ Exercise II

Given the following task dependency graph $($Fig$.1).$

Figure $1$: Task dependency Graph

Determine:

The Maximum degree of concurrency:

The minimum execution time:

Speedup over ONE process assuming that a large number of processes is available:

The speedup if only $4$ processors are available: