Suppose that you must perform three tasks, X, Y, and Z. You can only do one task at a time, and once that task is done, you never redo it. The tasks can be performed in any order, so there are 6 possible ways to accomplish them. I want you to draw a production system for this problem. The start state is "no tasks done." The goal state is "all tasks done." Each production is doing another task. Draw a complete search tree for this problem that contains exactly 8 states, including the two states I've already mentioned. HINT: The same state may be reached by doing tasks in a different order. That is, your states need not contain the information of what order the tasks were done; that information would be known by knowing what path was taken through the states.