. Given the following search tree, state the order in which the nodes are searched for: Depth first search Depth first iterative deepening Hill climbing Steepest ascent hill climbing Best first search Beam search with beam width set to 2 . A: 10 B:10 C: 5 D:4 E:2 F:11 G:3 H:0 1:11 J: 1 The numbers on the nodes indicate the estimated cost to the goal