1.) Let G be an n-partite simple graph, the partite sets of which are {ui, vi}, {u2, v2}, {un, Un}. Assume that the sequence of degrees d(v), d(u2), d(v2),..., d(un-1), d(vn-1), d(un), d(vn) is some permutation of the integers 0, 1, 2, 3,..., 2n - 2. (Note that every vertex except u is listed. Also, by saying "permutation", we are not told which degree goes with which vertex.) Deduce what d(u) and d(v) are. Justify your answer. (Once you understand what is going on, induction can be an effective way to formulate your proof.)