1. (Graphs: fundamentals.)

(a) Prove that if G is a simple graph on n vertices, then G contains at most n(n1) 2 edges.

(b) Prove the following claim: in every simple graph G on at least two vertices, we can always find two distinct vertices v, w such that deg(v) = deg(w).