3. Let d₁ ≥ d₂ ≥…..≥ dn ≥ 0. Prove that there is a loopless graph (multiple edges allowed) >. with degree sequence d₁,..., dn if and only if Σd; is even and d₁ ≤di.

Fig: 1