Artificial intelligence

Consider the search space depicted below for a hypothetical search problem. S is the initial state and T is the goal state. The cost of each edge has been labelled on the graph.

State s	A	B	C	D
h(s)	10	16	9	9

Consider the above table representing h(s) for each state s in the space. What path does the greedy search and A* search find using this h(s), and what is its cost?

2 D 11 2 $ OL 15 8 T 2 8 8 B