Formulate a shortest$-$path problem whose solution will minimize the costs for the following network. Then find the shortest path from $1$ to $7$ by using Dijkstra's Algorithm.