This problem appeared in our midterm. Now you can think without the pressure of time. Let G be a simple graph with m edges and n > 3 nodes where n = 2k is even. (a) If m = k2, find a graph G with m edges and n nodes such that G has no triangles. (b) Show that if m > k2, then G contains a triangle