Hi i am taking a AI class and i am stuck on these question

Given the following state space diagram, S is the start state, and G is the goal state. The heuristics are as follows: h(S)=9,h(A)=6,h(B)=5,h(C)=3,h(G)=0 If uniform cost search is used, then what is the solution an agent would find? a. S>A>C>B>G b. S>B>A>C>G c. S>A>C>G d. S>B>G The 8 puzzle problem with an initial state of and a goal state of If the total Manhattan distance of all tiles to its goal position is noted as heuristic ha, the total number of misplaced tiles is heuristic hb, then hb dominates ha. Select one: True False Given the following state space diagram, S is the start state, and G is the goal state. The heuristics are as follows: h(S)=9,h(A)=6,h(B)=5,h(C)=3,h(G)=0 If greedy best first search is used, then what is the solution an agent would find? a. S>B>G b. SA>C>G c. S>B>A>C>G d. S>A>C>B>G