Stack Work

. Write an application program [login to view URL], that uses the stack class, to decode a secret message. There will be two stacks, let’s call them stack1 and stack2. The user will enter a secret number, call it secret, followed by a string to be decoded terminated by an !. The program will read and throw away the first secret – 1 characters and push the next one onto stack1. This process is then repeated with stack2, then stack1, and so on. One exception: if the element at the top of the stack and the new character are both upper case letters, the new character should not be pushed but the algorithm should still switch to the other stack. The process should stop when no more characters are present in the string.