1) Write depth first search algorithm that traverses this tree. Initial node = A and Goal Node = R 2) Edit 1) by converting the algorithm into iterative deepening 3), Edit 2) by converting the algorithm into Depth Limited Search (level-2) Depth = 0 B D Depth = 1 E F G H Depth = 2 I J L M N Depth = 3 R S Depth = 4