Suppose you had a programming language with the only built-in container type being a stack. Explain how each of the following ADTs could be implemented, and give the running time for the basic operations. Try to come up with the most efficient implementation you can. Hint: you might use more than one stack to implement a given ADT. a) queue b) cursor-based List c) index-based list (random access)