Use Dijkstras algorithm (Algorithm 4.3) to find the shortest path from vertex v4 to all the other vertices for the graph in Exercise 2. Show the actions step by step. Assume that each undirected edges represents two directed edges with the same weight.

Show the graph after labeling it using Dijktra's labeling algorithm.

2. Use Pri im's algorithm (Algorithm 4.1) to find a minimum spanning tre fr the following graph. Show the actions step by step. 32 01 02 17 45 18 10 28 25 59 4 12