Given a simple graph G = (V, E), an independent set I V for G is a subset of V for which no two vertices in I are adjacent. Consider the following greedy procedure for producing an independent set for G. For the first round, select a vertex v V having least degree. Add this vertex to I. Then remove v from G along with all vertices adjacent to v. In addition, remove any edge that is incident with a removed vertex. Repeat this action on the resulting graph(s) until a graph with no vertices or edges is reached. Give an example, of a graph for which this greedy procedure does not produce an independent set of maximum size. Show each round of the procedure, and provide the graphs largest independent set.