2. The diagram below shows a tree search problem. Suppose the starting point is at 3 and the goal state is at 1 a. Show how Depth First Search will traverse the tree. (You may number the nodes below) 2 points b. Show how Breadth First Search will traverse the tree. (You may number the nodes below)..