Assignment 2 (4 points). Given is the weight matrix A of a directed graph D = (V, E): (a) Sketch the digraph. 0 2 4 1 0 1 2 5 0 3 1 (b) Use the Floyd-Warshall algorithm to determine the matrix of shortest distances between all pairs of vertices A and the corresponding matrix P to determine the paths. Write down the intermediate steps as well.