(2-b) Consider the state space and the associated heuristic given below. Initial state Goal State Page (214) Also, consider the heuristik Yunction h(n) as mentioned in the table 5 6 7 8 4 n 1 2 1 0 1 6 3 3 hin) 7 3 Show the sequence of nodes as visited by A algorithm. You do not need to redraw the state space every each step. For each step, show the ff.) computation for all relevant nodes. If two nodes have same f(.) value, assume A chooses a state whose number is lesser. [i.e. if f(1) = f(2), then the algorithm prioritize f(1) over f(2)]