For the following undirected graph answer the following: E 60 10 20 B. 30 40 50 D a) Represent the above undirected graph in adjacency matrices format. b) If there are any cycles in the above graph, show their paths. c) Using the above undirected graph and Kruskal's algorithm, show each stage for Safe Edge, Weight, and Spanning Tree until you get the minimum spanning tree; that is fill up the table below (Rewrite the table in your Answer Sheet and fill it) Safe Edge Weight Spanning Tree Actii Go to