Sub-question 1: Joanna faces a sort of shortest route problem---how to go from her home at node 1 to a classroom at node 6. She draws out all the possible routes as shown in Figure 1 and notices that 3 roads/branches in the network are one-way, while the others are two-way. Can she apply the shortest route search procedure (with 3-column) learned in her Management Science class and why? ____ ABCD____

A) No, she cannot because the search procedure assumes all the branches are undirected (two-way).

B) Yes, she can because she just needs to list out the branches according to their actual directions.

Sub-question 2: Consider the network given in Figure 1. Assume the number on each branch is the distance in miles and all the branches are undirected. What nodes are the 1^stand 3^rdclosest nodes to the origin (node 1)? ____ ABCD____

A) Nodes 2 and 4

B) Nodes 2 and 3

C) Nodes 2 and 6

D) Nodes 2 and 5

Sub-question 3: Consider the network given in Figure 1. Assume the number on each branch is the distance in miles and all the branches are undirected. What is the distance of the shortest route from node 1 to node 6? ____ ABCD____

A) 10 miles

B) 11 miles

C) 12 miles

D) 13 miles

Sub-question 4: Consider the network given in Figure 1. Assume the number on each branch is the distance in miles all the branches are undirected. What is the distance of the shortest route from node 1 to node 5? ____ ABCD____

A) 13 miles

B) 14 miles

C) 15 miles

D) 16 miles

Sub-question 5: Assume the network given in Figure 1 represents a telecommunication network. Assume the number on each branch is the length of cable in miles and all the branches are undirected. What is the minimum length of cable needed to connect all the nodes? ____ ABCD____

A) 16 miles

B) 17 miles

C) 18 miles

D) 19 miles