Theorem 1: (Handshaking Theorem): If G-(VE) is an undirected graph with m edges, then 2m-deg(v) Example 1:2166 people attend a job fair. Show that the sum, over the set of all of attendees, of the number of people an attendee will shake hands with is even. Assume that no one shakes his or her own hand