We have seen various search strategies in class, and analyzed their worst-case running time. Prove that any deterministic search algorithm will, in the worst case, search the entire state space. More formally, prove the following theorem Theorem 1. Let A be some complete, deterministic search algorithm. Then for any search problem defined by a finite connected graph G(V, E) (where V is the set of possible states and E are the transition edges between them), there exists a choice of start node so and goal node g so that A searches through the entire graph G