2. Let G = (V, E) be a graph with V = {$v_1, v_2, ..., v_n$}. Its degree sequence
is the list of degrees of its vertices, arranged in non-increasing order. That is,
the degree sequence of G is ($d(v_1), d(v_2), ..., d(v_n)$) with the vertices arranged
such that $d(v_1) \ge d(v_2) \ge ... \ge d(v_n)$. Below are different lists of possible
degree sequences. Determine whether each case can be a graph with n vertices.
If not, explain why not. If so, describe a graph with these degrees: is the graph
a complete graph, a cycle, a path, contains specific subgraphs, connected, etc?
(a) n = 7 and (6, 5, 4, 3, 2, 1, 0)
(b) n = 6 and (2, 2, 2, 2, 2, 2)
(c) n = 6 and (3, 2, 2, 2, 2, 2)
(d) n = 6 and (1, 1, 1, 1, 1, 1)
(e) n = 6 and (5, 3, 3, 3, 3, 3)
