Use Dijkstra's algorithm (Algorithm 4.3) to find the shrotest path from vertex v5 to all the other vertices for the graph represented by the array in Exercise 3. Show the actions step by step.

Exercise 3. Consider the following array:

	1	2	3	4	5	6
1	0		72	50	90	35
2		0	71	70	73	75
3	72	71	0		77	90
4	50	70		0	60	40
5	90	73	77	60	0	80
6	35	75	90	40	80	0