Question 5 - A*-search. Given the search space on fig. 1, where S is the initial state and G1 and G2 satisfy the goal test. Arcs are labeled with the cost of traversing them (so lower is better) G1 9 3 B 3 7 3 5 57 Ur 3 5 2 F43 8 3 7 Figure 1: State space for search problems and the estimated cost to a goal (i.e. value of heuristic function) is reported inside nodes. For A* search of state space given on fig. 1 answer the following questions 1. (25% of the credit) Which goal will be reached? 2. (25% of the credit) What is the state of the node that will be expanded (popped off frontier) 4th? (note that every node popped off the frontier counts) 3. (50% of the credit) Show what is the contents of the frontier (i.e. show in correct order all nodes) after expansion of 4th node. Recall that a node in frontier is a 4-tuple (state, parent-state, value of cost function g, value of evaluation function f). FOR EACH NODE IN FRONIER ALL COMPONENTS MUST BE SHOWN.