Written in C language

A critical path analysis is a technique used to determine the time schedule for a project. This information is important in the planning stages before a project is begun, and is also useful to evaluate the progress of a project that is partially completed. One method for this analysis starts by dividing a project into sequential events and then dividing each event into various tasks. Although one event must be completed before the next one is started, various tasks within an event can occur simultaneously. The time it takes to complete an event, therefore, depends on the number of days required to finish the longest task. Assume that the critical path for a major construction project has been stored in a data file, path.txt. Each line of the data file contains an event number, a task number, and the number of days required to complete the task. The data have stored such that all the task data for the first event are followed by all the task data for the second event, and so on. Write a program that reads the critical path information and prints a report (in table format) that lists the event number, task number and days required for all tasks requiring more than 5 days. Also print the total number of events for the project.

Make a .txt file named path.txt and drag it into your project with this numbers.

1 15 3 1 27 6 1 36 4 2 15 5 3 18 4 3 26 1 4 15 2 4 26 7 4 27 7 5 16 4