Following Figure 2 shows the search space where S is the START node, where C is the GOAL node. While, labeled arcs consist of heuristic cost of traversing the arcs. X A W B D 3 3 6 U 5 S 0 Figure 2: Search Space Provide the sequence of order states based on the Figure 2 in the following type of searching algorithm. Remember to STOP when you reach the GOAL node. (a) Breadth First Search [2 marks] (b) Depth First Search [2 marks] (c) Iterative Deepening Search [2 marks] (d) A* Search [2 marks] (e) Greedy Best-First Search [2 marks]