d) Suppose you have access to a stack ADT library, that is, an Abstract Data Type that includes operations to maintain a stack. Describe in words (no need code or pseudocodes) how you could implement...

Extracted text: d) Suppose you have access to a stack ADT library, that is, an Abstract Data Type that includes operations to maintain a stack. Describe in words (no need code or pseudocodes) how you could implement a queue's enqueue and dequeue operations using two stacks. Also, provide the Big-O complexity of your algorithm.