You are given an oracle O (i.e., blackbox algorithm) that takesas input an undirected graph G(V, E) and an integer k and outputs”yes” iff the graph is connected and contains a set of kindependent nodes. It outputs ”no” in every other case. Your taskis to design an algorithm that takes any undirected graphG’ (V’ , E’ ) and integerk as an input and returns ”yes” if G’ contains an independent setof size k. We will ask you to come up with two different solutions.Your algorithm may take O as a subroutine and may make polynomialmany calls to O. Your algorithm
OR
OR