I would appericate if someone could draw out and explain the different dependencies and processes using google draw or by hand.

Thanks

still not fully understanding this.

There are 14 tasks and below table shows the task dependency with required time to complete the task. Tahle 1 Denendenev amono Tasks 4. Draw a task-dependency graph. (5 points) 5. What are the critical path length and average degree of concurrency? ( 5 points) 6. Show an efficient mapping of the task-dependency graph of the decomposition shown in Table 1 on to three processes. (10 points) 7. Describe and draw an efficient mapping of the task-dependency graph of the decomposition shown in Table 1 onto four processes. ( 10 points)