10. Write a program which will rearrange and sort a stack of integer values, using two other stacks. The following algorithm describes how to do this: 1. Start with a stack of numbers named primary and two empty stacks named 1ower and higher. 2. Pop the first number from your primary stack and put it into the lower stack 3. Pop the next number from your primary stack, if it is smaller than the number you previously put into the 1ower stack, then add it to the lower stack, otherwise put it in the higher stack. 4. Repeat step 3 until the primary stack is empty. 5. Pop each of the elements from the lower stack and add them back into the primary stack. 6. Pop each element of the higher stack. If the value is greater than the value at the head of the primary stack, then add it onto the primary stack, otherwise add the number into the lower stack. 7. Repeat the process from steps 3 through to step 6 until both the higher and lower stacks contain no elements. At this point, the primary stack

In evaluating a postfix expression, if the symbol just read is the variable A then the next action is: (Points: 2) A. Push A onto the stack B. Write A to output string. C. Pop the stack. D. Read another symbol from input string

Given 2 integers as 2 lists of their digits, you have to compute their sum and output it as a list of its digits. If the integer is 1234 its corresponding list would be [1, 2, 3, 4]. You can assume the integers are non-negative. Input: [1, 2, 3, 4] [4, 3, 2, 1] output: [5, 5, 5, 5] Explanation: 1234 + 4321 = 5555 input: [9, 9, 9, 9] [1, 1, 1] output: [1, 0, 1, 1, 0] Explanation: 9999 + 111 = 10110