$(2$ marks$)$ Consider two graphs, $G_1$ and $G_2.$

Let the vertices of $G_1$ be labelled using the letters A$-$F$.$ The adjacency matrix for $G_1$ is the

following, where vertex A is represented by the first row and column, vertex B is represented

by the second row and column, and so on$.$

$\left[\begin{array}{cccccc}0& 1& 1& 1& 0& 0\\ 1& 0& 0& 0& 0& 1\\ 1& 0& 0& 1& 1& 0\\ 1& 0& 1& 0& 1& 1\\ 0& 0& 1& 1& 0& 0\\ 0& 1& 0& 1& 0& 0\end{array}\right]$

The adjacency list for $G_2$ is the following.

Are the graphs $G_1$ and $G_2$ isomorphic? If so$,$ provide an explicit mapping from the vertices

of $G_1$ to the vertices of $G_2.$ If not, explain how you can tell.