all content in these two photo are from the same question, thank you
9:12 1 1 Safari Assginment 1 To edit and save, sign in with an Office 365 subscription. Sign in 3JAnswer the following questions about the search problem shown here. Assume that ties are broken alphabetically. For instance, a partial plan SXA would be expanded before S→x+B. Node S is the “initial state’, and node Gis the goal show the cost of state’. Arrows indicate the possible actions (paths), and values s actions. For the questions that ask for a path, please give your answers in the form “S-A-D-G’ (10%). Tip: Build a search tree first. B D G 12 What path would uniform cost search return for this search problem? 1. Consider the heuristics for this problem shown in the table below 2. State A hg Is hl admissible? Justify Why? (i) Is h1 consistent? Justify Why? (ii) Is h2 admissible? Justify Why? (iii) (iv) Is h2 consistent? Justify Why? What path would A* graph search, using an admissible heuristic, return for this 3. search problem? Please draw the search tree and indicate frontier 1, 2, 3.