Given the following game tree, please apply minimax algorithm with alpha-beta pruning to mark what branches can be pruned from the search space and cross out those leaf nodes that will not be evaluated and those internal nodes that will not be concluded. Given the following search tree, state the order in which the nodes will be searched for steepest ascent hill climbing, and best first search. The numbers on the nodes indicate the estimated cost to the goal