2 (a) Define what is a graphic sequence. (b) Prove that a sequence di, da,...,n of positive integers are the degrees of an n-vertex tree if and only if di = 2(n-1). (e) Let da da 2... dn be the degree sequence of a simple graph with n vertices. Prove that, for 1 sk sn, di + dz +...+ dx