1. Consider the following tree B D C A E 0-0-0-0 S K L M G I J M L a) Breadth first search - Show the order in which the nodes will be visited by placing a number next to the node in the figure. For example if node E will be visited as 6th node place 6 next to the node in the tree. S will always be 1. [10 points] b) Repeat a) for depth first search [10 points] c) Repeat a) for depth first search with limit /=3. [5 points]