We state without proof the following Proposition. If β : V 1 → V 2 is an isomorphism between the two graphs G 1 = (V 1 , E 1 ) and G 2 = (V 2 , E 2 ), then for every vertex u ∈ V 1 , the degree of u (in G 1 ) is the same as the degree of β(u) (in G 2 ). (From now on you can use this statement in the same way you use any of the statements proven or stated in lecture.) Using this statement, give an example of two trees that have the same degree sequence but are not isomorphic. Justify your answer. You can either draw the graphs or list the vertices and edges.