Draw the undirected graph represented by the adjacency matrix below. Show how a breadth$-$first search and a depth$-$first search would traverse the graph starting at A$,$ indicating clearly how the contents of the stack or queue would be updated.$($e$)$ Draw the undirected graph represented by the adjacency matrix

$[5$ marks$]$ below. Show how a breadth$-$first search and a depth$-$first search would traverse the graph starting at $A,$ indicating clearly how the contents of the stack or queue would be updated.

$\backslash$table$[[,$A$,$B$,$C$,$D$,$E$,$F$,$G$],[$A$,0,1,0,1,0,0,0],[$B$,1,0,1,0,0,0,0],[$C$,0,1,0,0,0,0,0],[$D$,1,0,0,0,1,0,1],[$E$,0,0,0,1,0,1,0],[$F$,0,0,0,0,1,0,0],[$G$,0,0,0,1,0,0,0]]$