Consider the search tree shown in Figure 1. The number next to each edge is the cost of the performing the action corresponding to that edge. You start from the node A. The goal is the reach node G. List the order in which nodes will be visited using: . breadth-first search depth-first search. iterative deepening search (show all the iterations) uniform cost search (show cumulative costs of nodes). 4 6 4 2 4