public FHtreeNode find$($FHtreeNode root, E x$,$ int level$)$

$\{$

FHtreeNode retval;

$//$ first

if $($mSize $==0||$ root $==$ null$)$

return null;

$//$ second

if $($root$.$data.equals$($x$))$

retu rn root;

$//$ otherwise, recurse. don't process sibs if this was the original call

if $($ level $>0$ && $($retval $=$ find$($root$.$sib, x$,$ level$))!=$ null $)$

return retval;

return find$($root$.$firstChild, x$,++$level$)$;${?}^{******}$ Use the following general tree to answer problems $1$ and $2."*$

general tree:

Problem $1$

Assume that the call find$($nodeF$,N,1)$ is made. Starting at node F$,$ find node N$.$

Note: nodeF is a reference to node $F.$

Trace the method calls.

Specify the return value after each call is completed.