Stack with a queue. Assume that a stack is represented as a single queue so that each stack operations takes a linear number of queue operations. Design two algorithms to insert and delete form the stack using queue operations. Hint : To delete an item, get all of the elements on the queue one at a time, and put them at the end, except for the last one which you should delete and return.What is the running time of your algorithm?