Create an example novel (that is, not one of the problems in your lecture slides such as blocks world, spare tire, shoe etc...) problem. Your problem may be easy so you can solve it with less amount of steps. Represent this problem with one of the problem description languages you see in the lecture (STRIPS, ADL...), then choose one of the following:

1. Solve this problem by applying Partial Order Planning (POP) by hand, your solutionmust backtrack at least once before finding the solution, and you must show each step of the planning clearly.

2. Create a planning graph for the problem with at least two state levels, exclud- ing starting state level and your final state level must contain 4 different (negations does not count) literals. Indicate all mutex relations and their type (inconsistent effects, competing needs...) cleary. You do not need to find the solution.