Ques 4 Consider the following tree 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 6thnode place 6 next to the node in the tree. S will always be 1. [8 points] b) Repeat a) for depth first search [8 points] c) Repeat a) for depth first search with limit l=3. [4 points]