The ollowing problem is known as the K CL UE problem. You are given an undirected grap G w h V vertices and a number K other in G. For instance, if the graph is the one shown below and K-4, then a solution is B,D,G,H he go s to n a se o K ve tice a of which neare y connected to each B.J A How can you solve his problem using state space search? Give a precis escription o the state space involved: w at is a state what is the successor to a state, what is a star state, how do you recognize a goal state? The state space that you describe should be a tree B. Do you know in advance the depth of the goal states? Which search algorithm would be best: DFS, BFS, or iterative deepening? C. Suppose that you have a graph G with V vertices and that no vertex in G has more than Q edges connected to it. That is, Q is the maximum number of edges that all connect to the same vertex. In the graph in the diagram, vertex D has 6 edges connected to it, and no other vertex has more than 6, so Q-6. Give mathematical expressions in terms of the quantities V, K, and Qfor () the depth of your state space;(i) the branching factor of the state space; (iii) an upper bound on the size of the state space The ollowing problem is known as the K CL UE problem. You are given an undirected grap G w h V vertices and a number K other in G. For instance, if the graph is the one shown below and K-4, then a solution is B,D,G,H he go s to n a se o K ve tice a of which neare y connected to each B.J A How can you solve his problem using state space search? Give a precis escription o the state space involved: w at is a state what is the successor to a state, what is a star state, how do you recognize a goal state? The state space that you describe should be a tree B. Do you know in advance the depth of the goal states? Which search algorithm would be best: DFS, BFS, or iterative deepening? C. Suppose that you have a graph G with V vertices and that no vertex in G has more than Q edges connected to it. That is, Q is the maximum number of edges that all connect to the same vertex. In the graph in the diagram, vertex D has 6 edges connected to it, and no other vertex has more than 6, so Q-6. Give mathematical expressions in terms of the quantities V, K, and Qfor () the depth of your state space;(i) the branching factor of the state space; (iii) an upper bound on the size of the state space