Given the following search tree, state the order in which the nodes are searched for: - Depth-first search (10\%) - Depth-first iterative deepening (20 N) - Hill climbing (109]) - Steepest ascent hill climbing (20%) - Best first search (20 si) - Beam search with beam width set to 2(20%) The numbers on the nodes indicate the estimated cost of the node to the goal node