1. Given the following graph - The vertices are the small circles and the edges are the lines connecting them. A set of vertices is said to be independent if no two vertices in the set are connected by an edge. The independence number of a graph is the number of elements of the largest independent set. Independence numbers have applications in chemistry - if you think of the atoms of a molecule as the vertices and the bonds as edges, independence number is connected to the chemical stability of the molecule. Find the independence number of this graph. (Find the largest independent set you can and circle those vertices)