A residential moving company needs to move a family from city $1$ to city $12$

Figure $5\mathrm{.}40$ where the numbers on the arcs represents the driving distance in $mi$

between cities.

a$.$ Create a spreadsheet model for this problem.

b$.$ What is the optimal solution?

c$.$ Suppose the moving company gets paid by the mile and, as a result, wants

determine the longest path from city $1$ to city $12.$ What is the optimal solution:

d$.$ Now suppose travel is permissible in either direction between cities $6$ and

Describe the optimal solution to this problem. need spreadsheet solution with steps