Sructinn In this problem the start state is S, and the goal state is G. The transition costs are next to the edges, and the heuristic estimate, h, of the distance from the state to the goal is in the state's node. Assume ties are always broken by choosing the state which comes first alphabetically. (a) What is the order of states expanded using Depth First Search? Assume Depth First Search terminates as soon as it reaches the goal state. (2 marks) (b) What is the order of states expanded using Breadth First Search? (2 marks) (c) What is the order of states expanded using Greedy Search? Assume Greedy Search terminates as soon as it reaches the goal state. ( 2 marks) (d) What is the order of states expanded using A search? (2 marks) (e) What is the least cost path from S to G ? (2 marks)