Consider the following network: 2 12 5 5 4 14 1 3 12 7 3 4 7 6 6 9 4 4. CPM: i. Find earliest & latest occurrence times for each event. ii. Find critical path, minimum duration to complete the project and identify critical activities and non-critical activities. iii. For the non-critical activities, compute total and free float and identify red flag activities. iv. Create the time-schedule for all the activities