(1) (11) (iii) (iv) (v) (vi) (vii) Given the incidence matrix B = 110000 101010 001100 E= 010101 000011 and the weights for each of the edges { e ez es e4 es es 20 13 5 7 10 14 Draw the equivalent graph, G Write the adjacent matrix for graph, G Is the graph G Hamilton? Explain Is the graph Eulerian? Explain Find X(G) Is it possible to obtain a perfect matching from graph G? Explain. Find the minimum spanning tree using the Kruskal's algorithm (4 marks) (3 marks) (3 marks) (3 marks) (1 mark) (2 marks) (4 marks)