Consider a search space in which any node $n$ generates two children $2n$ and $2n+1.$ Suppose you are in node $1$ and you are looking for $15,$ show the order in which the nodes aie visited tf you are using.

a$)$ Depth first search