1. Applied Digital Solutions is expanding its operations to include a new product line for manufacturing bioelectronic computer chip. The project for manufacturing this computer chip has a high visibility. The following table lists the activities along with various probabilistic times and the dependencies: Activity Optimistic Times Most Likely 3 Immediate Predecessor Activities Pessimistic A 2 4 B 6 7 8 9 13 20 1 D 3 4 5 1 E 10 11 12 1 F 4 6 8 4 G 11 13 15 4 9 H 7 4 | | | | J 6 7 9 5 7 3,6 5 2,5,8 5 6 7, 9, 10 (Note that in the above table the predecessors are marked as A = 1, B = 2, C = 3, D = 4, etc.) Given the above data: K 4 (a) Draw an Activity-on-Arrow (AOA) network diagram representing the project. Put the node numbers in circles and draw arrow from node to node, labeling each arrow with the activity letter and determine time. (b) Identify all of the paths on the network diagram and note how long they are, using Figure 6- 8 as a guide for how to represent each path. Be sure to round up the duration for all activities. (c) What is the critical path for this project and how long is it? (d) What is the shortest possible time it will take to complete the project? (e) Draw manually the appropriate network diagram (using PDM) and then find (and also provide as a table) for each of the activities by d: early start (ES), early finish (EF), late start (LS), late finish (LF) and total floats and total slacks and provide them in a table form