D ELF G H Shortest Path Problem (bonus question) K L M NO P 0 R S U Z A AD AF AF AG From Distance S S S A A B B Go 1 0 0 0 1 0 Nede S A B C Net Flow 0 0 0 0 0 0 0 Sussieleman 1 0 0 0 0 0 -1 3 E T To A B C C D . E A B D F T A C T B 2 9 5 6 1 = in in 0 0 0 0 0 0 1 0 1 0 0 1 1 0 1 E F E T 0 2 3 Total Distance 6 7 For More Infind out an are on the stores/store//LOW'areal Format Adequaquas Set up the needed formulas and then use thEncel Solver to find out the shortest Total Distance with the following constrain a. The Net Flow Flow Out Flow in orch node should be equal to Supply Demand Nodes should only have one outgoing at Nec Flor Nose T should only one ingoing Flow. Al other nodes should one outgoing areandowingong the nodes on the shortest pather Flower 1 2 -4 D ELF G H Shortest Path Problem (bonus question) K L M NO P 0 R S U Z A AD AF AF AG From Distance S S S A A B B Go 1 0 0 0 1 0 Nede S A B C Net Flow 0 0 0 0 0 0 0 Sussieleman 1 0 0 0 0 0 -1 3 E T To A B C C D . E A B D F T A C T B 2 9 5 6 1 = in in 0 0 0 0 0 0 1 0 1 0 0 1 1 0 1 E F E T 0 2 3 Total Distance 6 7 For More Infind out an are on the stores/store//LOW'areal Format Adequaquas Set up the needed formulas and then use thEncel Solver to find out the shortest Total Distance with the following constrain a. The Net Flow Flow Out Flow in orch node should be equal to Supply Demand Nodes should only have one outgoing at Nec Flor Nose T should only one ingoing Flow. Al other nodes should one outgoing areandowingong the nodes on the shortest pather Flower 1 2 -4