Write a function that uses stack operations to move the nth element of the stack (counting from the top, where the top element is 1) to the top of the stack, leaving the rest of the stack unchanged. (If s.size()< n, throw std::underflowError.) For example, if stack s holds [15, 3, 2, 4, 16], after nToTop(3) it will be [15, 3, 4, 16, 2].

template void nToTop (stack& s, int n)