(a) Construct a sample connected undirected graph with 7 vertices and 14 edges. Run DFS on your graph, number the vertices with the DFS numbers and construct the DFS tree of your traversal. Show the DFS tree edges and back edges on your graph.

(b) Construct a sample connected undirected graph with 7 vertices and 14 edges. Run BFS on your graph, number the vertices with the BFS numbers and construct the BFS tree of your traversal.