quick pleasee

b) Use Dijkstra's algorithm to find the shortest route between cities 1 and 10 Show clearly the temporary 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 to City 10. 79 67 70 73 50 72/17 72 31 25 69 63 87 54 18 19 52 10 29 61 56 67 15 97 69 45 51 85 b) Use Dijkstra's algorithm to find the shortest route between cities 1 and 10 Show clearly the temporary 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 to City 10. 79 67 70 73 50 72/17 72 31 25 69 63 87 54 18 19 52 10 29 61 56 67 15 97 69 45 51 85