Problem 3: Consider the graph in Problem 2 Simulate A* search with a strict expanded list on this graph. At each step, show the path to the state of the node that is being expanded, the length of that path, the total estimated cost of the path (actual + heuristic), and the current value of the expanded list (as a list of states). Please provide the information requested into a table given below: Is the heuristic given in Problem 2 admissible? Explain. Is the heuristic given in Problem 2 consistent? Explain. Did the A" algorithm with strict expanded list find the optimal path? If it did find the optimal path, explain why you would expect that. If it didn't find the optimal path, explain why you would expect that and give a change of state values of the heuristics that would be sufficient to get the correct behavior. Problem 3: Consider the graph in Problem 2 Simulate A* search with a strict expanded list on this graph. At each step, show the path to the state of the node that is being expanded, the length of that path, the total estimated cost of the path (actual + heuristic), and the current value of the expanded list (as a list of states). Please provide the information requested into a table given below: Is the heuristic given in Problem 2 admissible? Explain. Is the heuristic given in Problem 2 consistent? Explain. Did the A" algorithm with strict expanded list find the optimal path? If it did find the optimal path, explain why you would expect that. If it didn't find the optimal path, explain why you would expect that and give a change of state values of the heuristics that would be sufficient to get the correct behavior