1-In (PERT) when finding the duration for each Path, if there are two paths, they are the longest. Which is the critical path, and what are the critical activities in this case? 2- In (PERT) when finding the duration for each path, we choose the longest path as the least time required to implement the project. Prove that we cannot complete the project in less than the longest path duration 3- In the following example on the (PERT) method, there is no task that depends on the task F, and the network must be closed to find all the paths. Identify and discuss with which node task F should be closed? A Conduct laterviews Note 3 B Questionnaires A C Read Reports Note 4 D Analyze Data Flows B.C E latroduce Prototypes B,C F Oberte Reactions E3 G Perform Cost Benefit D3 # Prepare Proposal G2 I Present Proposal 8.4 040404040 C4 F3