Question 2 Suppose that you need to find a path between S and G in the following graph. The number attached to each edge in the graph represents the actual distance of traversing the edge. Assume also that the estimated distances to the goal are given by the following table: Node:EstimatedDistancetoG:S6B1C3D2E5FG40 For each of the following search methods list the nodes in the order in which they are expanded by the search method while looking for a solution. As an illustration, the solution for Depth-Limited Search is provided below. Depth-Limited Search (depth-limit =2 ) List: [S,B,C] (a) Depth-First Search List: ( 2 marks) (b) Breadth-First Search List: (2 marks) (c) Uniform Cost Search List: (2 marks) (d) Greedy Search List: (2 marks) (e) A List: (2 marks)