Suppose we have three alterntaive types of graph represented using the standard notation Kn, Cn and Wn. Calculated the number of nodes and edges in all the three graph types. Also, draw each of the three graphs for n = 5. (c) Prove that in any undirected graph if we calculate the degrees of all nodes we will find an even number