You need to write down your full detailed work for all problems and submit the scan of the whole answer sheet to mycourses whose link will be provided later. 1 Determine the truth value of each statement below. You don't need to justify your 20 pts answer for this problem. (1) (4 pts) (T/F) There is a graph with the degree sequence (3, 3, 3, 3, 3). (2) (4 pts) (T/F) For a given graph G = (V, E), let ~ be a relation on V such that u ~w if and only if there is a path between v and w. The relation ~ is an equivalence relation. (3) (4 pts) (T/F) Let n 2 3. There is a connected graph G on n vertices such that E(G)