Consider application of the Breadth First Search (BFS) algorithm to the following graph: (i) Draw the graph, annotating the nodes with numbers (starting with 1) indicating a possible order in which the nodes are visited during an execution of the BFS algorithm. Assume the starting point is node D. (ii) Show the evolution of the associated queue data structure during execution of the BFS algorithm on the graph above. Start.