Consider the graph below:

Consider the adjacency matrix representation for the graph above. We recommend that you write down this

representation for the graph above. Select all the correct facts from the list below.

The matrix is an $88$ matrix, since there are $8$ edges in the graph.

The matrix is a $66$ matrix, wherein each row and column corresponds to a node in the graph.

To represent the edge $24,$ the matrix has an entry $1$ in the row corresponding to node $2$ and column

corresponding to node $4.$

If the graph were undirected, then the adjacency matrix equals its transpose.

The adjacency matrix for a graph with $n$ nodes and $m$ edges is an $mm$ matrix with $n$ entries that are $1.$

The adjacency matrix for a graph with $n$ nodes and $m$ edges is an $nn$ matrix with $m$ entries that are $1.$