Problem 4. Let G be an undirected graph. An independent set in G is a set of vertices Z such that no two vertices 1 J in Z are connected by an edge. Recall that the INDEPENDENT SET problem is, given a graph G and an integer K, find an independent set in G of size K. Answer the following questions: (a) Consider the problem of finding the largest independent set in a graph G. Suppose that you want to use a blind search method (DFS, BFS, or iterative deepening) to solve the problem. Describe a state space for this problem. You should specify (a) what are the states; (b) what are the actions; (c) what is the start state; (d) what is the goal state? (b) If the graph G has N vertices, what is the depth and the branching factor of your state space? Is it a tree? Is the depth of the shallowest goal known? (c) Which would be the best algorithm for this problem: depth-first search, breadth-first search, or iterative deepening? Why