. (4 pts) Consider the following graph. Do a breadth-first search of this graph starting at node A. When you have the choice of which node to visit, choose the node with the lowest letter of the alphabet. (e.g., choose B over C). Show the edges that are along the breadth-first path, and show the order in which nodes are visited (blackened). A B D (E Queue after processing node Nr. Node Prev Node Node Nr edges from start from Prev node NI edges from start Nade NE odges. Prev from Node Prev node NI edges from start Node Prey node Node Head A 0 Mode - Saved to this PC Search ces Mailings Review View Help Picture Format 2 ICS 340 Spring 2021 IC3 . (3 pts) What are the strongly connected components in the graph below? List them. There are 5. Solution: 0 0 0 o o O A B D E E F G H cy-lists representation of the undirected graph given above, d) s always equal to the determinant of product of a There infamia and thefadarbnb