Problem $3$: A Moving Company Problem A residential moving company needs to move a family from city $1$ to city $12($as shown below$)$ where the numbers on the arcs represent the driving distance in miles between cities. Answer the following questions: $1.$ What is the shortest path for this problem? Create a spreadsheet model and solve it$.2.$ Suppose the moving company charges by the mile and is unethical. As a result, they wish to find the longest route from city $1$ to city $12.$ What is the optimal solution? $3.$ Suppose there travel is permissible in either direction between cities $6$ and $9,$ what is the longest route from city $1$ to city $12?$ Explain the solver solution.