step by step answer

3. (a) Give the adjacency matrix for the weighted network given by A=1-5-4 -6 43 where the columns and rows label vertices 1 to 5 in order. (b) Use the adjacency matrix connectivity algorithm, starting by marking row 3 and crossing out column 3, to show whether this graph is connected. (c) Calculate A2 and hence find the number of paths of length 2 from vertex 1 to vertex 2. rthmb fi minmumnintr fr ht weighted network. (11 marks)