2.4 For each of the following, try to give two different unlabeled graphs with the given properties, or explain why doing so is impossible. (a) Two different trees with the same number of vertices and...

Extracted text: 2.4 For each of the following, try to give two different unlabeled graphs with the given properties, or explain why doing so is impossible. (a) Two different trees with the same number of vertices and the same number of edges. A tree is a connected graph with no cycles. (b) Two different connected graphs with 8 vertices all of degree 2. (c) Two different graphs with 5 vertices all of degree 4. (d) Two different graphs with 5 vertices all of degree 3.