Q$1$

$4$ Points

For question $1,$ consider the following undirected graph, represented as an adjacency list.

$A|B,C,D,E$

$B|A,C,E$

$C|A,B,D$

$D|A,C,E$

$E|A,B,D$

Q$1\mathrm{.}1$

$2$ Points

How many edges are in the graph?

Q$1\mathrm{.}2$

$2$ Points

What is the smallest value of $k$ for which the graph is $k-$colourable?