If vertices 2, 3 and 4 are added in the queue in the given order during the BFS visit, which vertex will be marked as visited first? Vertex 2 will be marked as visited first. Vertex 3 will be marked as visited first. Vertex 4 will be marked as visited first. None of the three given vertices will be marked as visited first.

Which of the following represents a correct order of visit during a breadth first search traversal of the given graph starting from vertex 1? 1, 2, 3, 4, 5. 1, 4, 5, 2, 3. 1, 5, 4, 3, 5. 1, 4, 5, 2, 3.

When will BFS traversal be complete for the given graph? BFS traversal will be complete when all the vertices are marked as visited and the queue is empty. BFS traversal will be complete when all the vertices are added to the queue.

Which of the following options are true regarding DFS and BFS traversals in the given graph starting with vertex 1? Both DFS and BFS will always visit the vertices in the same order. DFS order of traversal need not be the same as the BFS order of traversal for the give graph.

n topological sort, vertices are visited in which order?Marks : 1Negative Marks : 0Answer hereIn topological orderIn random orderIn descending order of their weightIn ascending order of their weight

code: from collections import dequedef bfs(graph, start, end): visited = set() queue = deque([(start, [start])]) while queue: current, path = queue.popleft() if current == end: return path if current not in visited: visited.add(current) for neighbor in graph[current]: queue.append((neighbor, path + [neighbor])) return None graph = { 0: [3], 1: [0, 2, 4], 2: [7], 3: [4, 5], 4: [3, 6], 5: [6], 6: [7]} start_node = 0 end_node = 7 path = bfs(graph, start_node, end_node)if path: print(f"Path from node {start_node} to node {end_node}: {path}")else: print(f"No path found from node {start_node} to node {end_node}") error: from collections import dequedef bfs(graph, start, end): visited = set() queue = deque([(start, [start])]) while queue: current, path = queue.popleft() if current == end: return path if current not in visited: visited.add(current) for neighbor in graph[current]: queue.append((neighbor, path + [neighbor])) return None graph = { 0: [3], 1: [0, 2, 4], 2: [7], 3: [4, 5], 4: [3, 6], 5: [6], 6: [7]} start_node = 0 end_node = 7 path = bfs(graph, start_node, end_node)if path: print(f"Path from node {start_node} to node {end_node}: {path}")else: print(f"No path found from node {start_node} to node {end_node}") fix the bug