Problem $2.$ Using the procedure TREE$-$SUCCESSOR and TREE$-$MINIMUM, write a function $F(x),$ where $x$ is a node in a binary search tree, to produce the output that INORDERTREE$-$WALK function would produce. Determine the upper bound running time complexity of $F(x)$ and prove its correctness.