Either draw a graph with the given specifications or explain why no such graph exists:
Full Binary Tree with height 4, 16 internal vertices.
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.
Use either Kruskal's or Prim's Algorithm to find a minimum spanning tree. Specify the algorithm you use and show your work. What is the weight of your spanning tree?
