S 404 -Artificial Intelligence (10 pts] Below graph shows state space with heuristic states. Smaller number for the heuristic is considered better. Use best first to find the least cost path that leads to the goal. The goal is to reach state U. Maintain "open" as the sorted list of states (priority queue) to record frontier of the current search. Closed list records states that are already considered. The graph below shows the opern and closed states after first two steps of best-first search. 2. Fall 2017 evaluations attached to each of the -search algorithm A-S D-4 C-67 1-5 G-5 H-5 1-5 E-4 F-3 5-4 M-2 N-2 0-4 P4 5 Q-s R-4 U-2 T-3 OPEN ) (CLOSED complete rest of the steps that would lead to the goal state U. 1. open-IAS); closed = [ ] 2. evaluate A5; open = [D4, B5, C61; closed = [AS] First two steps of the execution of best-first search are below. You are asked t