This question is based on the graph given on the right side.

a$.$ Write down the memory representation of the graph using both Array Matrix and Adjacency List.

b$.$ Simulate traversal of all vertices starting at node "A Undirected Graph using Breadth First Search $($BFS$).$ Use alphabetical order $($ascending$)$ to break ties You need to write the sequence of nodes in the above traversal. Show the state of your suxiliary data structures $($eg$,$ stack$/$queue$)$at$$each$$step$.$