Task 2 (3 points + 7 points + 5 points = 15 points) Inf 1. Build graph for the given matrix (3 points) Inf 12 5 Inf 14 2 Inf 15 12 4 7 8 18 12 Inf Inf 2 10 21 -5 1 Inf 5 2 -2 9 11 Inf 17 21 11 Inf 18 5 Inf Inf Inf Inf 9 Inf Int 20 Inf 6 2. Find the shortest (minimum weight) path from vertex 6 to vertex 2 using Bellman-Ford algorithm, find his weight (first stage of Bellman-Ford algorithm (7 points) and second stage of Bellman-Ford algorithm (5 points)). You should show all middle calculations in algebraic form