Consider G be graph with edges {{1, 5}, {1, 6}, {1, 8}, {2, 3}, {2, 5}, {2, 7}, {3, 4}, {3, 5}, {3, 6}. {3, 7}, {3, 8}, {4, 5}, {4, 6}, {5, 6}}
i) Find largest and smallest degrees of vertices of G
ii) does G contain the independent set of size three or more?
iii) does G contain clique(complete subgraph) size three or more?
iv) Find chromatic number of G, and describe.