Marks 10 Question 1: Draw the (1)stack (2)linear queue (the original one) data structures in array implementations for each step" in the following sequence: Insert and delete the following data in two data structures show the state of stack and Queue after executing each operation Queue insert 10, insert 56, insert 45, delete, insert 32 insert 78,insert 23,delete,delete insert 90 Stack push (10), push(56), push(45), pop().push( 32), push 78, push 23,pop().pop(), push 90 Assume an initial size of 5 for the array implementation. Remember to show TOP (top of the stack) for stack and both Front and back for queue. A) For Queue B) For Stack