1. Write the static method, user of the ADT Stack, public static Stack mergeSortedStacks (Stack s1, StackT s2), that takes two sorted stacks s1 and s2 (minimum on top) and returns one stack that is sorted (min on top). Do not use any auxiliary data structures other than stacks. Problem Example 2.1. If s1(top to bottom): 1, 4,6,8 and s2: 2,3,9, then after calling mergeSortedStacks (s1,s2) it will return stack contains : 1,2, 3,4, 6, 8,9 2. Write a static method pushElement, user of the Stack ADT, that pushes all occurrences of the element e to the bottom of the stack st, keeping the order of the other elements unchanged. The method signature is public static void pushElement (Stack st, T e) Example 2.2. If st (top to bottom): 23, 10, 14, 10,7,10,9,14. After calling pushElement(st,10), the stack st becomes st: 23,14,7,9,14,10, 10,10