So let's just take an example here. This is, I brought to you example that we covered in another module, the previous one focusing on the forward and the backward pass calculations. Drawing this activity on node diagram, we figured out this is the diagram. If I ask you then in this case, how many paths we have, it would be, This right here, A, B, D and G. We have A, B, E, and G. We have A, C, E, and G. And we have the last one A, C, F, and G. So that being said, the total duration of all these paths would be 4 plus 7 plus 8 plus 1 equal 20. The second one, A plus B plus E plus G would be 17 days. 4, 5, 5 and 1 equal 15. 4, 5, 2 and 1 would be equal 12. So in this case, we do have the longest duration of the project would be the first path, which will be the critical path for this example.