Rooted trees with unbounded branching

Given a tree whose node may have arbitrary numbers of children. There is a schema to

represent that kind of tree name left$-$child, right$-$sibling. Each node $x$ contains a parent

pointer $p,$ and two other pointers:

left$-$child$[$x$]$ points to the leftmost child of node $x,$ and

right$-$sibling $x$ points to the sibling of $x$ immediately to the right.

If node $x$ has no children, the left$-$child $[x]=$ NULL, and if node $x$ is the rightmost child of

its parent, then right$-$sibling $[x]=$ NULL.

i$.$ Give an example of a rooted tree with unbounded branching and draw its left$-$child,

right$-$sibling representation $(5$pts$).$

ii$.$ Write an $O(n)$ non$-$recursive procedure that prints all the keys of an arbitrary rooted

tree with $n$ nodes, where the tree is stored using the left$-$child, right$-$sibling

representation $(5$pts$)$