A project team has established a network diagram for a project, however did not include all the information required.

The project manager has some information available about the project activities. Below is the list of all the clues he knows:Each of the activities, labeled $\backslash (\backslash$mathrm$\{$A$\}-\backslash$mathrm$\{$G$\}\backslash ),$ has a different duration between $1$ and $7$ weeks. Durations $($weeks$)$ are $1,2,3,4,5,6,7.$One activity has a float of $3$ weeks. Another activity has a float of $6$ weeks. Two activities have a float of $8$ weeks.There exists only one critical path, and its duration is the largest possible number given the above duration of the activities.Activity E has the smallest amount of float that is non$-$zero.The EF of Activity A is $4$ Weeks, which is different than the LF of A$.$Activity F takes at least $2$ Weeks longer than Activity C$.$

Using your knowledge about CPM and applying the Forward Pass and Backward Pass rules, identify all entries in the table below: