5. A Graph is non-linear data structure consisting vertices (nodes) and edges. a. Draw an undirected graph connecting at least 7 nodes containing Euler path. Also assign and show a random number as the weight for each edge in the graph. (4 marks) b. Write the sequence of edges in the Euler path. c. Produce a matrix that represents the graph drawn in (a). (2 marks) (2 marks) d. Illustrate each step for finding the minimum spanning tree of graph drawn in (a) using the Kruskal's algorithm. e. Describe "minimum spanning tree" in general (2 marks) (2 marks)