1 ALWAYS TRUE, NEVER TRUE or SOMETIMES TRUE - beef up your grade Each question is 4/3 points. If you are unsure, you can give (very short -itting space below) 1. In A with admissible heuristic, when a node with goal state is expanded, AT NIT expanation for your answers we have reached goal via the shortest possible path 2. Simulated Annealing doesn't make 'bad' moves (ie. decreasing goal function) AT NT STT unless at a local extremum. If a state space is a finite tree then given an initial state and a set of goals, DFS and BFS return the same goals (possibly none) AT NT STT 3. AT NT ST 4. If a state space is a finite DAG then A will find opitmal goal path for any (admissible) heuristic