stacks and queues questions these questions are intended as self-test for readers answers may be found in appendix suppose you push and onto the stack then you pop three items which one is left on the stack which of the following is truea the pop operation on stack is considerably simpler than the remove operation on queue the contents of queue can wrap aroundwhile those of stack cannot the top of stack corresponds to the front of queue in both the stack and the queueitems removed in sequence are taken from increasingly high index cells in the array what do lifo and fifo mean true or falsea stack or queue often serves as the underlying mechanism on which an adt array is based assume an array is numbered with index on the left queue representing line of movie-goerswith the first to arrive numbered has the ticket window on the right then there is no numerical correspondence between the index numbers and the movie-goer numbers the array index numbers and the movie-goer numbers increase in opposite left-right directions the array index numbers correspond numerically to the locations in the line of movie-goers the movie-goers and the items in the array move in the same direction as other items are inserted and removeddoes particular item in queue move along the array from lower to higher indicesor higher to lower suppose you insert and into queue then you remove three items which one is left true or falsepushing and popping items on stack and inserting and removing items in queue all take (ntime