Use the function n$2$top$()$ from Written Exercise $7-17($b$).$ Write a program that enters five

integer values and pushes them onto a stack. The program should execute each of the following

actions:

a$.$ Move the second element to the top of the stack, leaving all elements beneath it unchanged.

Output its value.

b$.$ Move the last element of the stack to the top. Output its value.

c$.$ Flush the stack, and output its elements.