Each node shows a city in the network below. Since the arcs between the nodes show the direction and distance, find the shortest path from node $1$ to node $4$ by using Bellman Equation Algorithm and calculate the distance for this path. $(20$P$)$ please solve this question by using L$2=$ min$[$L$1+$ L$12]=02=-2$ this kind of equations.