Given below is the task dependency graph, weighted node represents the take, and each directed edge represents its dependency Answer next $4$ questions based on this graph.

What is critical path and its length, why critical path is important?

$2)$ What is the best possible parallel computation time? What is maximum degree of concurrency?

$3)$ What is the parallel computation time for $2$ processors?

$4)$ Minimum processor needed to achieve the maximum speed up$?$