• SL: the state list, lists the states in the current path being tried.
• NSL: the new state list, contains nodes awaiting evaluation.
• DE: dead ends, lists states whose descendants have failed to contain a goal node.
• CS: the current state

QUESTION 6 (15 marks) EF? J K L M N OP Follow the example in the book and discussed in the class. Do a "Hand run" of the backtracking algorithm on the graph in the Figure above. Begin from state A. Keep track of the successive values of NSL, SL, CS and DE. Assume there is no goal state in the search space