Describe using pseudocode algorithms that perform the following operations: i) [2 marks] enqueue(e). (make sure it maintains the correct count of the number of elements) ii) [2 marks] dequeue(). (make sure it maintains the correct count of the number of elements) You are not allowed to make any other data structures, other than S and T or temporarily local variables within the algorithm. Use the ADTs as defined in class (in the notes). To be clear, you can only use push(e), pop(), size(), peek(), and isEmpty() from S and T; do not assume anything about the underlying implementation of the stacks. In your pseudocode, just use the "." notation to call the functions, e.g. S.peek() calls peek for stack S, and T.push(e) pushes element e onto stack T. b) [2 marks] Compute the worst-case time complexity in terms of Big-Oh of each of the operations, assuming the stacks are implemented using linked lists, and explain how you computed their time complexities. Activate Windows