Show your work, not just your final answer!!!!

Breadth First Search

a$)$ Represent this graph as an adjacency matrix. Arrange the vertices in alphabetical order as row

and column labels. $[$Draw this on paper. You do not have to write code to create a data structure.$]$

b$)$ Represent this graph using adjacency lists. Arrange the neighbors of each vertex in

alphabetical order. $[$Draw this on paper. You do not have to write code to create a data structure.$]$

c$)$ Show the steps of a breadth first search with the graph given above using the technique given

in the class notes. Use the adjacency lists representation that you created in $1b.$ Start at vertex A$.$

Show the contents of the queue each time that a node is added to the queue or removed from the

queue. Draw the resulting tree $-$ all the nodes labeled with their processing order and the edge

that caused each node to be added to the queue. Finally, list the nodes in the order they are

processed. $[$Give a queue, a tree, and a processing list.$]$