this is all i have + this

Part 1: Complete the table below: 1) Start day is the latest finish day of all predecessors. 2) Finish day is start day + duration. 3) Slack is computed with a backwards pass, beginning at F (Finish). 4) If a task has multiple predecessors, one or more of the predecessors may have slack> 0. Tasks which are the only predecessor of their successor task have zero slack. 5) Slack days = (latest predecessor finish day) - (earlier predecessor finish day) Pred OODA Task Description 1 Obtain HW 2 Coding 3 Write test plans 4 Write training manuals 5 Install and test HW 6 Integration testing 7 System testing 8 Install SW (user site) 9 User training 10 Acceptance testing F Finish Dur 30 90 60 90 30 45 Start Finish Slack 0 0 0 0 55 1 2,5 3,6 7 4,8 9 10 5 10 0 10 . Part II: Create a schedule by completing the table below: 1) Use the completed table from Part 1 and a 2021 calendar to specify start and finish dates for each task as calendar dates. The network diagram may be helpful for visualization. Assume a 5-day work week, Monday-Friday. (Ignore holidays, every week is a full work week.) Start dates are always Mondays, finish dates are always Fridays. In other words, the predecessor task ends on a Friday, the successor task begins on Monday. 2) Copy the slack days from the table above to the table below. 3) What is the critical path? Finish Date Slack I Task Start Date Start March 19 1 March 1 2 March 1 3 March 1 4 March 1" 5 6 7 8 9 10 Finish Critical path: 1 5 2 6 ur Pred 30 90 60 90 30 1 45 2,5 55 10 7 5 4,8 10 9 S 3,6 8 ct has ten tasks, as shown above. March 2021 through December 2021. 10 F ish day of all predecessors. duration 1