For the following project, the network flow diagram and the probabilistic times are given below. Then find the critical path.
| Task | A | B | C | D | E | F | G | H | I | J | K |
| Least Time | 4 | 5 | 8 | 2 | 4 | 6 | 8 | 5 | 3 | 5 | 6 |
| Greatest Time | 8 | 10 | 12 | 7 | 10 | 15 | 16 | 9 | 7 | 11 | 13 |
| Most Likely Time | 5 | 7 | 11 | 3 | 7 | 9 | 12 | 6 | 5 | 8 | 3 |
The Critical Path, the longest necessary path through a network of activities when respecting their interdependencies, which may be identified with the Program Evaluation and Review Technique and the Critical path method
So we have to find out the longest path in this assignment for Critical Path
Follwing are some path from A to K
A-C-E-H-K
B-E-H-K
D-F-H-K
D-G-J