Q1 4 Points From the choices below, only select those statements that are correct: The Depth First Search (DFS) algorithm always finds the optimal path from the initial state to the goal state. The fringe in the Breadth Frist Search (BFS) is implemented as a last-in-first- out queue. In the DFS algorithm, the size of the fringe grows linearly with the depth of the search tree. In the BFS algorithm, the size of the fringe grows exponentially with the depth of the search tree. In the Uniform Cost Search, if we set the cost of actions to one, we obtain the BFS algorithm. The 'Explored' set is an ordered memory structure to store the nodes already removed from the fringe. The Uniform Cost search is guaranteed to return the optimal path to the goal state. In the Greedy search, the nodes in the fringe are ordered according to the heuristic estimate of their distance from the goal state