Fill the table below using the Activity-on-Arrow (A-o-A) network given and answer the questions. (Arrows between Node 2 & 4, Node 3 & 4, Node 8 & 9 are dummy activities) G. Activity Duration (days) 3 4 EST EFT LST LFT TF FF IF D. 3 G. 6. 3D 4 K 3. If the activity D is delayed by 4 days and activity K is delayed by 1g how many days will the project be delayed? www

Problem 2. Dijkstra's Algorithm Find the minimum cost (time) path from node A to all other nodes in the network shown below: 1-45 North US 290 I-610 A 3.5 min 20 min 2.0 min 15 min I-10 West 4.0 min 3.0 min 3.0 min US 59 K 4.0 min Solve the problem using the Dijkstra algorithm. Apply the notation explained in the lecture.

Prepare a precedence diagram and indicate the critical path for the following by taking durations in weeks. (PLEASE HELP I NEED GOOD DRAWİNG

This is the 3rd time I am giving the same questions. Which method is corect ? Method 1 or 2 ?    Frist time I got answers from you as method 1.  The second time your answers were haisy. You gave answers  by method 2 as Ra= 12 kn and Rb=28kn  but posted SFD and BMD  on the basis of method 1 ?   Please clarfy the answers.