1/30 Card No1 Task 1 (3 points + 7 points + 5 points = 15 points) 3 1 1. Build graph for the given matrix (3 points) Inf 15 12 8 9 14 9 15 Inf 13 18 1 6 3 12 13 Inf Inf 20 Inf 1 18 Inf Inf 4 20 8 9 1 20 4 12 9 14 6 Inf 20 12 Inf 7 9 3 1 8 9 7 Inf 8 Inf 2. Find the shortest (minimum weight) path from vertex 4 to vertex 3 using Dijkstra algorithm, find his weight (first stage of Dijkstra algorithm (7 points) and second stage of Dijkstra algorithm (5 points)). You should show all middle states of graph