3. What values are printed by the StackMystery algorithm below when given the following binary search tree as an input? 2 -5 10 -10 2 Input bst for StackMystery Input: bst: binary search tree with n nodes Input: n: size of bst 1 Algorithm: StackMystery 2 stack = Stack() a Add bst Root to stack 4 while stack is not empty do 6 Print node. Value 7 if node-RightNIL then sstack.Push(node.Right) end o | if nodeLeftNIL then 1stack.Push node.Left) 13 end