Suppose that both vertices and edges are assigned costs in a graph, and that a cost of a path is equal to the sum of the costs of its edges and vertices. Modify Dijkstras algorithm to find least expensive paths under this scheme (use pseudocode and let TOLL(v) be the weight of vertex v).