The following figure illustrates a network in which node 0 is the central node. Link costs are specified next to the corresponding links. The link capacities for all links are equal to 8. Assume w = 1, W = 5, W3 = 3, W4 = 3, W5 = 2. Apply the Esau-Williams algorithm to obtain the access network. Show all your work. Find the cost of the access network obtained. 6 3 4 10 + 6 3 6 5 6 5 A 1 2 6 7 5 2 5 0 Acti Go to