(a) The independence number of a graph G is the largest number of vertices no two of which are connected by an edge. Determine the independence numbers of the two graphs Gi and G2 shown below 5. 6 marks Ul V2 U2 V6 U6 U7 V3 U3 U5 V5 G1 G2 U4 V4 (b) What is the independence number of a graph of n vertices every two vertices of which are connected by an edge? What is the independence number of a graph with at least three vertices and only one edge (6 marks) (c) (8 marks)