Given the following search tree, please state the order in which the nodes will be searched by using hill climbing, steepest ascent hill climbing, depth$-$first iterative deepening, best$-$first search, and beam search with beam width set to $2.$ The numbers on the nodes indicate the estimated cost to the goal.