Consider the following conceptual diagram of a tree. (A label of each node is a node label.)

1. Draw an implementation diagram of first childext sibling representation of this tree.

2. For a DFS(Depth First Search) tree traversal, draw a stack with labels of nodes when a node R is visiting. List the sequence of all visiting nodes in this traversal method.

3. For a BFS(Breadth First Search) tree traversal, draw a queue with labels of nodes when a node I is visiting. List the sequence of all visiting nodes in this traversal method.

8 J K M N R U