Task 2 (3 points + 7 points + 5 points = 15 points) 1. Build graph for the given matrix (3 points) Inf -6 -7 8 Inf 12 5 Inf 8 Inf -7 Inf Inf 11 Inf 5 -1 5 Inf Inf 21 Inf Inf Inf 12 1 -4 -1 12 -4 Inf 1 -1 13 Inf 13 -1 20 Inf 1 1 12 10 Inf -4 Inf -4 Inf 2. Find the shortest (minimum weight) path from vertex 2 to vertex 6 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