Draw the undirected graph that is represented by the following: vertices:1,2,3,4,5,6,7edges:(1,2),(1,4),(2,3),(2,4),(3,7),(4,7),(4,6),(5,6),(5,7),(6,7) Answer the following: - Is the resulting graph connected? - Is the resulting graph complete? - Give the depth first traversal of the graph (begin at vertex 1 and choose the lowest numbered vertex to resolve "ties"). - Give a spanning tree for the graph