Q #1. Apply concepts of Advanced Data Structures to implement template classes for FIFO Queue and Stack. Both FIFO Queue and Stack will be based on arrays. Foot print of both the classes is shown below: In main(), use objects of both Stack and Queue to check if a string entered by the user is palindrome or not and display the result on screen (30-Points) Page 1 of 2 class stack class Queue private: int Front; int Rear; int Length; int maxSize; T*List; public: Queue (int); -Queue (); bool IsEmpty(); bool IsFull(); void Enqueue (T); T Dequeue (); int getsize(); void displayQueue (); private: T+ stackPtr; int MaxSize; int Topofstack: public: Stack( int size); -stack(); void Push(int data); T Pop(); bool IsEmpty(); bool IsFull(); int getstacksize() void Displaystack(); 1