Please complete the stack trace chart and fill in the final result.

3. (2 pts) An RPN expression can be stored in a list as follows rpn Recall the algorithm to compute the value of a valid RPN expression using a stack [23, 3, "-", 4, 6, "+", "1"] = 1. Set i equal to O 2. Set x equal to rpnlij 3. Set s equal to an empty stack. 4. While i is not equal to the length of the rpn list, do the following a. If x is a number, then push x on stack s b. If x is a string (i.e. operator), then do the following i. Pop stack s and store number in b ii. Pop stack s and store number in a ii. If operator is"+", push a b on stack s iv. If operator is"-", push a -b on stack s. v. If operator is"*", push a b on stack s vi. If operator is"/", push a Ib on stack s c. Add 1 to i 5. Pop stack s and return this number as the final result. Trace how this algorithm computes the value of the following RPN expression stored as a list rpn [9, 3, "+", 7, 5, "-", "*", 6, 2, "1", 1, "+", "1"] = Complete a new stack trace whenever a number is pushed or popped to show how the stack progresses throughout the computation. The first three stack traces are shown for you. Use Courier 12 pt font to make the spacing easier to handle if you type answers 3 99 12 Final result returned: (@INvilao10233542