Give the adjacency matrix for the weighted network given by 5 2 4 53 where the columns and rows label vertices 1 to 5 in order. Use the adjacency matrix connectivity algorithm, starting by marking row 1 and crossing out column 1, to show whether this graph is connected. Calculate At and hence find the number of paths of length 2 from vertex 3 to vertex 1 Use Kruskal's algorithm to find a minimum spanning tree for the weighted network