i mainly need help with how to do nine and what the graph would look like so if you could explain it that would be great.

Problem 1: A 3-foot-tall monkey is in a room where some bananas are suspended from the 8- foot ceiling. She would like to get the bananas and specifically end up on the ground with the bananas. The room contains two stackable, movable, climbable 3-foot-high crates, which you can call Cl and C2. The monkey is initially on the ground, as are both of the crates, and nothing is under the bananas initially. Assume that the monkey wants to accomplish their task with the fewest possible actions. Give a complete problem formulation as a search problem, precise enough to be implemented. Recall that our definition of a search problem involves specifying the set of all states, a non-empty set of start states, a non-empty set of goal states, the successors function that maps each state onto the set of states that are reachable in a single action, and a cost function mapping state transitions to their costs, which for this problem would just have a cost of 1 for each transition. In answering this question, do the following: a. Develop notation for describing a state precisely (i.e., indicating where everything is, whether the monkey is holding the bananas, etc). Try to find a concise notation for this. b. In your notation, specify the start state. c. In your notation, specify the goal state. d. Draw a graph that shows ALL states in the problem and all transitions. That is, the graph should have a node for each state from the set of all states, and use directed edges to show the successors function (i.e., you'll have a directed edge from one node to another to show that a state is a successor of another). Problem 1: A 3-foot-tall monkey is in a room where some bananas are suspended from the 8- foot ceiling. She would like to get the bananas and specifically end up on the ground with the bananas. The room contains two stackable, movable, climbable 3-foot-high crates, which you can call Cl and C2. The monkey is initially on the ground, as are both of the crates, and nothing is under the bananas initially. Assume that the monkey wants to accomplish their task with the fewest possible actions. Give a complete problem formulation as a search problem, precise enough to be implemented. Recall that our definition of a search problem involves specifying the set of all states, a non-empty set of start states, a non-empty set of goal states, the successors function that maps each state onto the set of states that are reachable in a single action, and a cost function mapping state transitions to their costs, which for this problem would just have a cost of 1 for each transition. In answering this question, do the following: a. Develop notation for describing a state precisely (i.e., indicating where everything is, whether the monkey is holding the bananas, etc). Try to find a concise notation for this. b. In your notation, specify the start state. c. In your notation, specify the goal state. d. Draw a graph that shows ALL states in the problem and all transitions. That is, the graph should have a node for each state from the set of all states, and use directed edges to show the successors function (i.e., you'll have a directed edge from one node to another to show that a state is a successor of another)