Do you have a steps instruction how to create this project network in Microsoft project.

You are creating a customer database for the Hillsboro Hops minor league baseball team. Draw a project network given the information in the table that follows. Complete the forward and backward pass, compute activity slack, and identify the critical path. How long will this project take? How sensitive is the network schedule? Calculate the free slack and total slack for all noncritical activities. ID Description Predecessor Time (days) Systems design None 2 Subsystem A design A 1 C Subsystem B design A Subsystem C design A E Program A 2 F Program B C 2 Program C 2 H Subsystem A test E 1 Subsystem B test 1 Subsystem C test Integration H,1,J 3 Integration test K 1 1 E-I O mono NNN MOOOIX 1 L 1 Step-by-step solution Step 1 of 2 A Sensitivity of Network Schedules The AON project network is a project network with activities being represented as nodes in the network. The forward pass starts with the first activity and flows through the designated process till reach the end activity. The forward pass gives the earliest times. It contains early start ES and early finish EF. Using forward pass the expected time TE to finish the project can be calculated. EF can be calculated as, EF = ES + DUR DUR is the time taken to complete that activity. The backward pass starts with the last activity in the project and traces back to the starting activity. It contains late start LS and late finish LF. Late start can be find as, LS=LF - DUR Slack SL is the time an activity can be delayed without delaying the project. SL is calculated as SL=LS-ES Free slack is the amount of time an activity can be delayed without affecting the immediate successor activity. Project network is built using the following legend: Legend ESD EF SL Description LS DUR LF The project network is shown below: 2 B 3 0 Subsystem A design 2 1 3 3 E 5 0 Program A 3 2 5 5 H 6 0 Subsytem A test 5 1 6 F 0 0 3 0 A 2 Subsystem design 2 2. 2 0 3 Subsystem B design 1 3 5 Program B 2 5 3 0 2 5 0 I 6 Subsytem B test 1 6 5 2 D 3 0 Subsystem C design 2 1 3 3 G5 0 Program 3 2 5 6 K 8 0 Integratio n 5 J 6 0 Subsytem C test 5 1 6 6 2 8 You are creating a customer database for the Hillsboro Hops minor league baseball team. Draw a project network given the information in the table that follows. Complete the forward and backward pass, compute activity slack, and identify the critical path. How long will this project take? How sensitive is the network schedule? Calculate the free slack and total slack for all noncritical activities. ID Description Predecessor Time (days) Systems design None 2 Subsystem A design A 1 C Subsystem B design A Subsystem C design A E Program A 2 F Program B C 2 Program C 2 H Subsystem A test E 1 Subsystem B test 1 Subsystem C test Integration H,1,J 3 Integration test K 1 1 E-I O mono NNN MOOOIX 1 L 1 Step-by-step solution Step 1 of 2 A Sensitivity of Network Schedules The AON project network is a project network with activities being represented as nodes in the network. The forward pass starts with the first activity and flows through the designated process till reach the end activity. The forward pass gives the earliest times. It contains early start ES and early finish EF. Using forward pass the expected time TE to finish the project can be calculated. EF can be calculated as, EF = ES + DUR DUR is the time taken to complete that activity. The backward pass starts with the last activity in the project and traces back to the starting activity. It contains late start LS and late finish LF. Late start can be find as, LS=LF - DUR Slack SL is the time an activity can be delayed without delaying the project. SL is calculated as SL=LS-ES Free slack is the amount of time an activity can be delayed without affecting the immediate successor activity. Project network is built using the following legend: Legend ESD EF SL Description LS DUR LF The project network is shown below: 2 B 3 0 Subsystem A design 2 1 3 3 E 5 0 Program A 3 2 5 5 H 6 0 Subsytem A test 5 1 6 F 0 0 3 0 A 2 Subsystem design 2 2. 2 0 3 Subsystem B design 1 3 5 Program B 2 5 3 0 2 5 0 I 6 Subsytem B test 1 6 5 2 D 3 0 Subsystem C design 2 1 3 3 G5 0 Program 3 2 5 6 K 8 0 Integratio n 5 J 6 0 Subsytem C test 5 1 6 6 2 8