Problem 1. (1 points) Give an example of Heuristicl evaluation runcuor dith Problem 2. (3 points) Consider the search problem below with start state S and goal state G. The transition costs are next to the edges, and the heuristic values are next to the states. (1) What is the final path for this DFS search? If a node has multiple successors, then we always expand the successors in increasing alphabetical order. (2) What is the final path for this A search? Explain by steps in details. (3) Is the heuristic function in this example admissible? Explain why