Q71 6 Points Present pseudocodes for enqueue (with the input parameter x) and dequeue (with the output parameter y) and state their time complexities. In the pseudocodes, use indentation in a clear way, follow the syntax of pushStack and popStack statements as in Question 6, additionally you can use the statements like While si is not empty While s2 is not empty IF $1 is empty then ERROR IF S2 is empty then ERROR IF S1 is empty then ... IF 52 is empty then ... IF $1 is not empty then ... IF S2 is not empty then ... You can also assume that the size of each stack is sufficiently large to store all data (no need to check if adding an item into a stack exceeds its capacity). The pseudocode for enqueue and its big-O complexity class (for big-o, use parametern denoting the total number of elements in the queue): Enter your answer here The pseudocode for dequeue and its big-o complexity class (for big-o, use parameter n denoting the total number of elements in the queue): Enter your answer here Q7.2 1 Point Suppose we start with empty stacks S1 and 52. First we perform n enqueue operations and after that n dequeue operations. What is the overall time complexity? O 0(1) O O(logn) O O(n) O O(n log n) O O(n) O O(n) O none of the above