An undirected graph is given below, with the weights labelled on its edges. k m 5 d a) Give an adjacency matrix representation of the graph. b) Give an adjacency list representation of the graph. c) If you traverse the graph by Breadth First search algorithm using a as the source vertex, what is the visiting order of vertices in terms of their discovery time. Write only the order of vertex labels! d) Find and draw Minimum Spanning Tree (use any algorithm, do not show your steps) e) Find and draw Shortest Path from vertex a to vertex f(use any algorithm, do not show your steps) K=5 m=5 p=2