6. Let GG be a graph of order 6, and let v be any vertex of G. (a) Explain why deg(v) > 3 in one of G or G. (b) In whichever graph (G or G) that has deg(v) > 3, let v be adjacent to each of w, z, and y. Explain how it is guaranteed that either GG or G' must have a triangle. (c) Explain why the above argument guarantees any group of six people will certainly either have three of them who all know each other or three none of whom know each other