Following refer to breadth-first traversals of graphs and trees. a. Determine the purpose of queue in breadth-first traversal? b. Assume you had the function call displayAtDepthN, which when given tree and depth would display only nodes at that depth. Describe how this could be utilized to give breadth-first traversal of tree, and why it would not be as effective as one using queue.