Continuing the previous problem, develop a sample model with your own choices of N, M, and L that barely stay within Solver’s limit. You can make up any input data. The important point here is the...

Continuing the previous problem, develop a sample model with your own choices of N, M, and L that barely stay within Solver’s limit. You can make up any input data. The important point here is the layout and formulas of the spreadsheet model.

In Maude’s shortest path problem, suppose all arcs in the network are “double-arrowed,” that is, Maude can travel along each arc (with the same distance) in either direction. Modify the spreadsheet model appropriately. Is her optimal solution still the same?