INSTRUCTIONS:

All coding is on PYTHON .

Answer this as soon as possible.

3. Create a class DoubleStack to implement two stacks in one array Api....n] in such a way that neither stack overflows unless the total number of elements in both stacks together is size n. The Push and Pop operations should run in 041). The class should implement following functions: a. Write a constructor that takes an integer 'size' as argument and creates an array for "size' number of elements. b. Write a function Push that inserts an element for the stack 's'. c. Write a function Pop that removes an element for the stack's'. d. Write a function Peek that retums an element for the stack 's'. e. Write a function IsEmpty that returns true stack 's' is empty. f. Write a function Count that returns the number of elements in stack 's' class DeubleStack: # size = number of elements det _init_self, size): // your code goes here # s = 1 or 2 det Posbuself, s, value): 11 your code goes here # stack = 1 or 2 det pospel, ): 1/ your code goes here # s = 1 or 2 det Peskelf, 9): 77 your code goes here # s = 1 or 2 det Jseapta sel, 5): 1/ your code goes here # s = 1 or 2 det Ceuotself, .): // your code goes here Example: ds Doubstach 10) da Euab 11,10) #push 10 in stack 1 da Euab/2,20) #push 20 in stack 2 da Euab/1,30) #push 30 in stack 1 print (daules/1) } #pop from stack 1 print (davocb/2)) # peek from stack 2 #the function should return 30 20