Either draw a graph with the given specifications or explain why no such graph exists.

1. Binary tree, height 4, 8 terminal vertices.
   
   
   
   
2. Simple graph, connected, 5 vertices, five edges.
   
   
   
3. Are these two graphs isomorphic? If so label their vertices so that the isomorphism is apparent. If not, list an isomorphic invariant that is violated.