BFS algorithm

Consider the undirected graph below. Draw the spanning tree that is constructed for the graph by the Breadth First Search Algorithm. Label each node in the spanning tree in the order in which it was deleted from the FIFO queue. Include the non-tree in your drawing. Recall that the neighbors of any vertex are processed in alphabetic order. Show the result of the BFS if the driver program begins the traversal at vertex E (instead of our usual choice of vertex A). Show the result of the BFS if the driver program begins the traversal at vertex J (instead of our usual choice of vertex A)