1. List the order in which nodes are visited in the tree below for each of the following four search strategies. < A. Depth-first search (choosing left most branches first)+ B. Iterative deepening search (increasing the depth by 1 each iteration and choosing left most branches first) < C. Breadth-first search+ D. Uniform cost search. Assume that the cost from the root to each node is as follows:+ node 1 2 3 4 5+ 6 7 8 9 10 11 12 13 cost 0 2+ 1+ 3+ 4+ 3+ 5+ 10+ 5+ 6+ 9+ 7+ 10 10 11 12 13