Write a Pseudocode in java.

1 Implement two stacks in one array of size n in such a way that neither stack overflows unless the total number of elements in both stacks together is n. Write pseudocode for two PUSH and POP operations each of which takes one of the two stacks as an argument. 2 Extend the operations for a queue to a double ended queue (deque). Write pseudocode to support enqueueing and dequeueing from either end of the structure. 3 Write pseudocode to implement a queue data structure only given access to stack data structures. That is, show how enqueue and dequeue could work if they were implemented just using PUSH and POP. 4 Implement a queue using a linked list. That is, use linked list operations to implement enqueue and dequeue. 5 Write pseudocode for the list operations on a doubly linked list. 6 Write pseudocode to reverse a given linked list in (1) space (i.e., other than the input list, you can only use a constant amount of memory). 7 Write recursive pseudocode for the linked list operations Size, FindAt and FindKey. Discuss the pros and cons of the recursive and non-recursive solutions. 8 We can express insertion sort as a recursive procedure as follows. In order to sort A(1...n), we recursively sort A(1...n-1) and then insert A(n) into the sorted array A(1...n-1). Write pseudocode for this recursive version of insertion sort. 9 Write a recurrence equation for the worst-case running time of this recursive version of insertion sort and solve it. 10 Find the runtime of the recursive search procedure on a sorted array