https://mycourses.msstate.edu/bbcswebdav/pid 1609101 dt content rid 270514661 201 830.Group02/Program%20295281 %29.pdf Assignment 1: C++ OOP using Stacks Data Structures and Analysis of Algorithms, ccm290 Objectives To strengthen student's knowledge of C++programming To give student experience in writing Object Oriented code Background Stacks are a simple, but useful data structure in Computer Sdience. The idea behind the stack is the LIFO structure, where items added to the stack first are removed from the stack last. Stacks are typically implemented as either an array or a set of nodes connected by references. Stacks always have a top reference that points to the top of the stack 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 w, reverse(w) AND w w- 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