Question#1 The figure below shows an artificial environment where an agent A is positioned in the square (1, 1), the goal G is in (1, 3), and there are holes B in (1, 2) and (2, 2). If the agent enters a square with a hole it dies. The agent can move of one square at the time, horizontally, vertically, but not diagonally. Formalize the problem of reaching G as a search problem. 1. Describe the initial and final state. 2. Describe the operators. 3. Find an admissible heuristics for A*. 4. Assume the operators have cost 1, draw the tree generated by A*. 3 G 2 B 1 A 1 2 3