Suppose you want to find the shortest path from node 1 to node 6 in the figure below. The length of each arc is given next to each arc. 2 3 6 2 1 3 6 1 3 5 7 If you represent this problem as a transshipment problem and show on a transportation tableau, what should be (Demand of node 5, cost between nodes 3-4, cost between nodes 2-5), respectively? O a. (1,3,0) O b. None of these C. (1,3,M) where M is a positive large number. Od (0,3, M) where M is a positive large number. e. (0, -3,0)