Oracle O outputs True if undirected graph G(V,E) is connected and contains a set of k independent nodes. Using O, design in pseudocode:

Oracle O outputs True if undirected graph G(V,E) is connected and contains a set of k independent nodes. Using O, design in pseudocode:

1) an algorithm that takes undirected graph G'(V',E') and integer k, and outputs True if G' contains an independent set of size k without modifying G.

2) an algorithm that does the same thing, but you can now modify the graph and it only calls O once