Your friend was working with the following undirected graph and he was simulating BFS on it. But he accidentally selected both node A and node E as source. Which means he selected both nodes A \& E, marked them as visited and pushed them into the queue initially. Then he went on with performing normal BFS. 15 Simulate the resulting BFS for your friend. What is the resulting traversal order and what will the level of each node be. Assume that both nodes A&E are at level 0. You don't need to write code