Implement a method rotate(a,r) that rotates the array a so that a[i] moves to a[(i + r) mod a.length], for all i {0,...,a.length}.

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.