Data structures C++ please

Exercise 1.4. Suppose you have a Stack, s, that supports only the push(x) and pop() operations. Show how, using only a FIFO Queue, q, you can reverse the order of all elements in s.

Exercise 1.5. Using a USet, implement a Bag. A Bag is like a USetit sup- ports the add(x), remove(x) and find(x) methodsbut it allows duplicate

elements to be stored. The find(x) operation in a Bag returns some ele- ment (if any) that is equal to x. In addition, a Bag supports the findAll(x) operation that returns a list of all elements in the Bag that are equal to x.