[10 pts] Depth First Search with Bound Below graph shows state space. Use Depth First Search algorithm with bound of 3 to find a path that leads to the goal state 0. Evaluate immediate child states of a parent state from left to right. Show the below lists for each iteration. Maintain "open" as the list of states (stack) to record frontier of the current search. "closed" list records states that are already considered. In order to be able to trace the path to the goal, you should either maintain a separate "State List" or maintain ancestor information within "open" and "closed" lists as ancestor and child pair. N7