Write in C++

Instructions In this assignment, you will implement a node-based stack and use the implementation to solve the palindrome problem. A palindrome is a special word or phrase that when reversed produces the original word. In other words, if we have a string w, w is a palindrome if Wr reverse(w) AND w wr For example, "mom', is palindrome because reverse("mom")-mom", and mom"-mom." Other palindromes include: 1. Step on no pets 2. Kayak 3. Noon 4. No word, no bond, row on. (Note: only a palindrome if spaces are removed). For this assignment, your Stack class does not have to be templated. Data in each node of the stack should be a "char." The following is a UML diagram that describes the methods and attributes needed for each class