Please provide solutions.

Question 6 10 pts Note: In order to receive credit, you must follow the pseudo-code conventions. A recursive version of a preorder tree walk algorithm and basic stack operations are provided below: PREORDER-TREE-WALK (x) 1 if x # NIL N 3 print x.key PREORDER-TREE-WALK (x.left) PREORDER-TREE-WALK (x.right) 4 Basic stack operations: STACK-EMPTY(S): indicates whether the stack S is empty PUSH (S, x): inserts an element x into the stack S POP(S): removes and returns the last inserted element You are required to complete the nonrecursive version of the preorder tree walk algorithm below. The algorithm uses stack as an auxiliary data structure. PREORDER-TREE-WALK-WITH-STACK (x) 1 create a new stacks Your code begins here