please explain

Exercise 3.14. Design and implement a MinStack data structure that can store comparable elements and supports the stack operations push (x), pop(), and size(), as well as the min() operation, which returns the minimum value currently stored in the data structure. All operations should run in constant time. Exercise 3.15. Design and implement a MinQueue data structure that can store comparable elements and supports the queue operations add (x), remove(), and size(), as well as the min () operation, which returns the minimum value currently stored in the data structure. All operations should run in constant amortized time. Exercise 3.16. Design and implement a MinDeque data structure that can store comparable elements and supports all the deque operations add first (x), add last (x) remove first(), remove last() and size(), and the min() operation, which returns the minimum value currently stored in the data structure. All operations should run in constant amortized time. The next exercises are designed to test the reader's understanding of the implementation and analysis of the space-efficient SEList: Exercise 3.17. Prove that, if an SEList is used like a Stack (so that the only modifications to the SEList are done using push(x)add(size(),x) and pop()remove(size()1)), then these operations run in constant amortized time, independent of the value of b. Exercise 3.18. Design and implement of a version of an SEList that supports all the Deque operations in constant amortized time per operation, independent of the value of b. Exercise 3.19. Explain how to use the bitwise exclusive-or operator, , to swap the values of two int variables without using a third variable