Exercise 7.

Suppose \(G\) is a graph with \(n\) vertices, each having degree 5.

1. For which values of \(n\) does this make sense?

2. For which values of \(n\) does the graph have an Euler path?

3. What is the smallest value of \(n\) for which the graph might be planar? (tricky)