The following table defines the successor functions Succ, heuristic H and goal B. The successor function Succ(s) returns a set of pairs {(1,2), ..., (scn)} such that s is a given state, s, is a successor state, and is the cost to go from states to s; . The function H(s) returns an estimate of the distance between a state s and a state satisfying the goal. The B(s) function returns "True" if the state s matches the goal, and "False" otherwise. Table 1 State So SI S2 S3 S4 S5 $6 S7 s Succ(s) (8,3), (3, 2), (83,4)} [(5,1). 184,1)) (4,5)} {(s6,1)) {(2, 1), (36,1)] } (85, 11) ($5,3)] h(s) 4 4 2 7 1 4 0 0 B(s) False False False False False False Tru True e 1. Give a trace of the execution of the A* algorithm using the space of states and the goal function and the heuristic function h defined in Table 1. For each state in the open and closed lists, give its values f and g. Iteration Open List (state, f, g),... Closed List (state, f, 8), ... 0 1 3 2. Is the heuristic function h admissible? Justify your answer. 3. If the goal function were modified such that B(86) = False, what will happen? Be as specific as possible. The following table defines the successor functions Succ, heuristic H and goal B. The successor function Succ(s) returns a set of pairs {(1,2), ..., (scn)} such that s is a given state, s, is a successor state, and is the cost to go from states to s; . The function H(s) returns an estimate of the distance between a state s and a state satisfying the goal. The B(s) function returns "True" if the state s matches the goal, and "False" otherwise. Table 1 State So SI S2 S3 S4 S5 $6 S7 s Succ(s) (8,3), (3, 2), (83,4)} [(5,1). 184,1)) (4,5)} {(s6,1)) {(2, 1), (36,1)] } (85, 11) ($5,3)] h(s) 4 4 2 7 1 4 0 0 B(s) False False False False False False Tru True e 1. Give a trace of the execution of the A* algorithm using the space of states and the goal function and the heuristic function h defined in Table 1. For each state in the open and closed lists, give its values f and g. Iteration Open List (state, f, g),... Closed List (state, f, 8), ... 0 1 3 2. Is the heuristic function h admissible? Justify your answer. 3. If the goal function were modified such that B(86) = False, what will happen? Be as specific as possible