Assume each arc in the diagram goes only in the direction indicated by the arrow. The shortest route algorithm is applied to the network to determine the shortest route from B to I. The first nodes placed in the permanent set are E, C, F, and H. The next node could be None of the other answers is correct K. 5. B 12 3. 4 D G (M 00 2. 5. 6, E. 2. 3. 3. 2)