Given the table of tasks, predecessors and random duration parameters, calculate the following.

Generate an AON network.

Determine the deterministic Critical Path $($CP$).$

You do not need to do the complete "forward$-$pass, backward$-$pass CPM analysis$--$ just use inspection of all possible completion paths, using the task means.

Use that CP tasks' means and variances to analyze for the probability that the CP duration will be less than or equal to $11$ weeks.

Additional analysis: Use all paths' mean and variance to determine probability that the $($entire$)$ project will be less than or equal to than $11$ weeks