For each part, explain why a $($simple$)$ graph with the following properties cannot exist, or give an

example of such a graph.

$1)$ There are $9$ nodes each having degree $5.$

$2)$ The graph is connected and has $12$ nodes and $13$ edges, including a cycle.

$3)$ Every node has $4$ neighbors and there are $10$ edges in total.