Shortest Path Problem (bonus question) From Distance Go Supply/Demand Net Flow 0 0 0 0 Nodes S A B D E T 0 0 0 0 S A B B = = = 0 -1 0 = o 1 2 3 4 B C D C F E A B D F T T B T D D D E E E B 9 9 0 1 2 3 5 0 Total Distance 0 For this problem, we need to find out if an arc is on the shortest path or not (Yes=1, No=0) (the YELLOW area). For example, if SB is part of the shortest path, cell F5 equals 1. If not, cell F5 equals 0. Set up the needed formulas and then use the Excel Solver to find out the shortest Total Distance with the following constrain: a. The Net Flow (Flow Out - Flow In) of each node should be equal to Supply/Demand. Node S should only have one outgoing arc (Net Flow = 1). Node T should only have one ingoing arc (Net Flow = -1). All other nodes should have one outgoing arc and one ingoing arc if the node is on the shortest path (Net Flow = 0) or no flow (Net Flow = 0)