For the following figure, assume that each task takes one cycle to finish:

1) Using unlimited processors to schedule the above graph, label each task and show how they are scheduled optimally. What's the minimum number of processors that you will need?

2) For the schedule in part 1, what is the speedup, efficiency, and throughput?

3) Repeat parts 1 and 2 with the assumption that only two processors are available.

90-0--0-0-0-0 90-0--0-0-0-0