Using queues to implement a stack 10 points; individual-only in lecture, we considered two implementations of the stack adt: one using an array and one using a linked list. devise a third implementation of the stack adt that uses two queues, q1 and q2. use pseudocode to describe how you would use q1 and q2 to implement the stack operations push, pop, and peek, and give the running time of each operation using big-o notation. explain briefly how you came up with the big-o expressions that you use. your algorithms for these methods may use q1, q2, and a constant number of additional variables (either fields of the stack object or local variables of the method). they may not use an array, linked list, orbther data structure. you may assume that the queues support the operations in our queue interface, and that they can store an arbitrary number of objects of any type.