below. O D h= You are given a graph as shown A h= 1 5 S h= 8 3 7 9 E B h= G h= h= LO 5 h= The start and goal state are S and G, respectively. For each of the following graph search strategies, work out the order in which states are expanded, as well as the path returned by graph search. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. a) Greedy Search b) A* Search c) Is h admissible? d) by contradiction, prove that A* provide an optimal solution