Circle TRUE or FALSE. No justifications needed. T/F T/F T/F T/F T/F T/F If T is a tree with 20 vertices, then there is a simple path in T of length 20. Every tree is bipartite. There is a tree with degrees 4, 3, 2, 1, 1, 1, 1, 1. There is a tree with degrees 3, 3, 3, 2, 2, 1, 1. If T is a tree with 30 vertices, the largest degree that any vertex can have is 29. If two trees have the same number of vertices and the same degrees, then the two trees are isomorphic.