Solve the following graph using the algorithm A. The arc costs are marked. List all the nodes expanded in the order they are expanded and give the f values for all nodes expanded. Show the search tree as by using backwards-pointed arcs. What nodes are on open at the end of the search? What nodes are on closed? Give the resulting solution path and its cost. Is this heuristic admissible? Is it monotonic? Is algorithm A admissible on this problem? Here is the heuristic function h for each node in the graph with node T being the goal: A B C D E F G H I J K L M N O P Q R S T 7 6 6 6 5 4 4 0 4 0 2 1 0 0 2 1 0 3 0 A (start) 0 3. 2 2. F 4 H 2 (goal) Solve the following graph using the algorithm A. The arc costs are marked. List all the nodes expanded in the order they are expanded and give the f values for all nodes expanded. Show the search tree as by using backwards-pointed arcs. What nodes are on open at the end of the search? What nodes are on closed? Give the resulting solution path and its cost. Is this heuristic admissible? Is it monotonic? Is algorithm A admissible on this problem? Here is the heuristic function h for each node in the graph with node T being the goal: A B C D E F G H I J K L M N O P Q R S T 7 6 6 6 5 4 4 0 4 0 2 1 0 0 2 1 0 3 0 A (start) 0 3. 2 2. F 4 H 2 (goal)