Question $2.[25$ marks$]$

Write the pseudo code of a non$-$recursive algorithm BST$\_$Search$\_$non$\_$recursive$($Node $\sqrt[\phantom{2}]{?},$ int $k)$ to search a key value $k$ in a binary search tree with root node. If $k$ is found in the binary search tree, return the node containing it; otherwise, return NIL. A node is defined as follows.Answer:BST$\_$Search$\_$non$\_$recursive$($Node root, int k$)\{$