Hello, could you help me for my Operations Management homework?

1. (18 points) Consider the following network. d 5 2 2 9 7 3 Find the shortest path between s and t using Dijkstra method. What is the shortest path? What is the shortest distance? Note: Please use the given table for the solution (see next page). Table 1: You can solve the Dijkstra problem here b S f t inf inf inf inf inf inf inf T T T T T T T 0 di) 0 p(i) T/P T di) 0 p(i) T/P di) p(i) T/P di) 0 p(i) T/P di) 0 p(i) T/P di) p(i) T/P di) 0 p(i) T/P di) 0 p(i) T/P di) 0 p(i) T/P 0 1. (18 points) Consider the following network. d 5 2 2 9 7 3 Find the shortest path between s and t using Dijkstra method. What is the shortest path? What is the shortest distance? Note: Please use the given table for the solution (see next page). Table 1: You can solve the Dijkstra problem here b S f t inf inf inf inf inf inf inf T T T T T T T 0 di) 0 p(i) T/P T di) 0 p(i) T/P di) p(i) T/P di) 0 p(i) T/P di) 0 p(i) T/P di) p(i) T/P di) 0 p(i) T/P di) 0 p(i) T/P di) 0 p(i) T/P 0