Goal: In Module 6, we discussed the Graph data structure. Sincethe graph is a non-linear structure, there is no unique traversal.Nodes can be found using Breadth-First Search (visit the siblingnodes before visiting the child nodes) and Depth-first search(visit the child nodes before visiting the sibling nodes). Based onthe implementation of the Graph data structure discussed during ourlecture (provided in the starter code):
1. Create the method bfs(start). This method takes the key ofthe starting node and performs Breadth-first search in an instanceof the class Graph. This method must return a list that containsthe order in which the nodes where accessed during
OR
OR