1) Please answer full question (a,b) for thumbs up.

1. Consider a block world problem, in which you have a number of blocks, all of the same size. The blocks can be on the table or on top of other blocks. A robot arm can pick up one block at a time if nothing is on top of it. A block can be deposited either on the table or on top of another block. The goal is to have a stack of 3 blocks in a specific empty location on the table.
3. a) Describe the state space representation of the problem. Describe the initial state, the states, the goal condition, and the actions.
4. b) Propose a non trivial (i.e. not h(n)=constant) heuristic. Is your heuristic admissible?