1. The complete graph with 8 vertices has 36 edges. 2. The number of edges in K20 is 2:11\"? 1). 3. The sequence 3n = 3"\" 2'\" (n 2 0) satises the recurrence relation 3M2 = 53n+1 Sen forn= 1,2,3...\" 4. Let G be the graph with vertex set V = {1, 2, 3, . .. , 11}I with vertices 15,1) E V being adjacent if and only if |v u| = 1. Then G has chromatic number 2. 5. m e {0, 1,2,3,4, 5}