a) Formulate a linear programming model to determine the shortest distance from City to City 10 (clearly define the decision variables. b) Use Dikstra's algorithm to find the shortest route between cities 1 and 10 Show clearly the temacrary and permanent labels for each node where these labels contain two entries (Distance, Predecessor) Report clearly the shortest route (or routes in case there is more than one) from City 1 to City 10. 73 67 70 12/17 50 31 72 25 69 69 63 3 87 18 19 18/ 34 52 29/ 61 97 56 is 67 45 51 60 a) Formulate a linear programming model to determine the shortest distance from City to City 10 (clearly define the decision variables. b) Use Dikstra's algorithm to find the shortest route between cities 1 and 10 Show clearly the temacrary and permanent labels for each node where these labels contain two entries (Distance, Predecessor) Report clearly the shortest route (or routes in case there is more than one) from City 1 to City 10. 73 67 70 12/17 50 31 72 25 69 69 63 3 87 18 19 18/ 34 52 29/ 61 97 56 is 67 45 51 60