Given a string, str$,$ the task is to write a complete C$++$ program that removes all the duplicate adjacent characters from the given string. The program then prints the characters that remain in the string.

You can assume that the string behaves like an array of characters. You must use a stack in the implementation of your solution. If you are left with an empty string your code should print "Empty String"

$\backslash$table$[[$Input$,$Output$],[$apple$,$ale$],[$aabbcc$,$Empty String$],[$aadbbgccdga$,$dgdga$],[$excellent$,$excnt$],[$maddam$,$Empty String$]]$

Notice that given the choice of a stack for the implementation we are reevaluating the sequence as the letters get removed, and letters get pushed together, as in the last example. After the d$\text{'}$s get removed the a$\text{'}$s become adjacent, and after they are removed the m$\text{'}$s become adjacent leaving you with an empty string.