Bidirectional Graph Traversal

For an undirected graph, create a function that visits its vertices with both Breadth-First Search (BFS) and Depth-First Search (DFS), then returns each visitation sequence. Input Format: Line one gives an integer n, representing the total number of nodes. The next n lines each specify an edge using two integers, u and v. Output Format: Line one shows the BFS visitation sequence. Line two shows the DFS visitation sequence. Test Cases: The BFS result explores all neighbors of…