Use dynamic programming to find the shortest path with phyton cod. From state 1 to state 11 we want to see the shortest route. We try to find our shortest path with minute values. We used dynamic programming to find the shortest path. We also want to use a cod written from phyton to show our solution.

stage 1 stage 2 stage 3 stage 4 Stage 5 f4(8)=138min+f5(11)=168minf4(9)=145min+f5(11)=175minf4(10)=121min+f5(11)=151minf5(6)=547min+f4(8)=715min543min+f4(9)=724min472min+f4(10)=623min