BFS and DFS search. Use C++.

"Starter Code:"

3. Exercise Use the starter code provided on Moodle to finish the following programming exercises. Show TA your work and get credit for this lab. 3.1 BFS. Write a method that prints the vertices in a graph visited in a breadth-first search (BFS) and the vertex with the maximum number of adjacent nodes void Graph: :findNodewithMaximumAdjacent(string); The function should print the BFS sequence and the node that has the maximum number of adjacent nodes. The argument of the function is the starting point of BFS Example. For the following graph, 10 25 35 40 The expected output by calling findNodewithMaximumAdjacent ("10") should be 10 25 35 40 25 The first line prints out the BFS traversal sequence, while the second line prints out the node(s) that has maximum number of adjacent nodes. When multiple nodes have same number of maximum number of adjacent nodes, print out all nodes. Hint. Use BFS algorithm to traverse the graph, while keep track of number of adjacent nodes for each node