* Optional extra credit question: Finding a small coloring * Suppose you have access to an oracle which, given a graph G, returns the largest independent set of G (in the form of a list of vertices).1 Using calls to the afore- mentioned oracle, design an efficient algorithm for finding a logx(G)(n)-coloring of a graph G with n vertices, where (G) is the chromatic number of G. * Optional extra credit question: Finding a small coloring * Suppose you have access to an oracle which, given a graph G, returns the largest independent set of G (in the form of a list of vertices).1 Using calls to the afore- mentioned oracle, design an efficient algorithm for finding a logx(G)(n)-coloring of a graph G with n vertices, where (G) is the chromatic number of G