For a given undirected, unweighted simple graph and a fixed positive integer k$,$ the k$-$coloring problem asks us to assign a color to each vertex, using at most k different colors, such that no two adjacent vertices have the same color.

$($a$)$ Just for a warm up explain why this graph cannot be $2-$colored but can be $3-$colored.