I need help with these questions PLEASE HELP

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 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)=8,h(C)=9,h(D)=3,h(G)=0 If greedy best first search is used, then what is the solution the agent will find? a. S>B>C>S>A>D>G b. S>B>C>S>B>C... the agent could not find a solution c. S>A>D>G d. S>BC>S>B>G e. S>B>G 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 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 A search is used, then what is the solution an agent would find? a. S>A>C>G b. S>B>G c. S>B>A>C>G d. S>A>C>B>G