C++

The total time required to complete each path is computed by summing all the times to carry out the activities on the path. The critical path is defined as the path that requires the most amount of time to complete The time estimates for the various activity paths involved in a project are showrn graphically in Figure 1. 7 weeks 0 5 weeks 4 weeks 0 6 8 weeks 10 weeks Figure 1 For this assignment: The first file, "Path.dat", will be read into a 4x4 array called Paths. Print the time required to perform each activity on each path as shown in the output, . Compute and print the total project time (the sum of all the paths). . Create two data files The second file, "Times.dat" will be read into a 6x7 array called Times. below Compute and print the total time needed to follow each path. Identify and print the critical path. e The paths are: Path 1- Path 2- Path 3- Path 41 4 6 7 125 7 1 3 5 7 Output: critical path analysis time 1 time 2 time 3 total time path (weeks) (weeks) (weeks) (weeks) 5 7 6 9 10 10 10 8 8 2 20 21 24 4 6 total Project time -87 critical path - path 4 Hand in: Program listing. Program Output. You may wish to create variables such as Src and Dst to identify the source station and destination station. The values for these variables, of course, come from the Paths array. The time to make the transition from Src -Dst is obtained from the Times array