Please show the steps clearly The number on the left is 3

A truck must travel from City 1 to ity 9. As shown in Figure below, a variety of rout are available. The number associated with each arc is the number of gallons of fuel re by the truck to traverse the arc. These numbers are given in the Table below. As the f process are now expensive, the company's management is trying to launch a strategy of the route that minimizes the total use of fuel. a) Formulate a mathematical model for this problem. Note: Formulate your model in an open form and while formulating it, give index (or indeces), decision variable (s) and parameter (s), explicitly to receive credits. b) Solve this problem using Dijkstra's algorithm. Show each step of the algorithm prope and finally determine the least-costly route and the total fuel consumption. (1,2 (1,3) (1,4 (2,4) (2,5) (3,4) (3,6) (4,5) (4,6) (4,7) (5,7) (5,8) (6,77 (6,9) (7,8 (7,9) (8,9) 1 8 7 1 8 Distance 2 5