Need the solution of this program STEP-BY-STEP please!

Question 1. ( 6 points) This question involves the use of type Stack and Queue. Here are the class definitions for stacks and queues of integers. class 5 tack {// integer stack: Stack|): // construct empty stack void push(int k)i/( push k on the top of the stack int popll: // delete item on top of the stack \& return a copy of it int top[D: // return a copy of item on top of the stack bool isEmpty(): // true if stack is empty, otherwise false In class Queve 1// integer queve: Queue(1: // construct empty queue void insert(int k ): // insert k at the rear of the queve int removed:// delete item at front of the queue B return a copy of it. int front(): // retum a copy of item at front of the queue bool isempty(): // true if queue is empty, otherwise false l: Write a program that reads a sequence of integers from cin and writes yes on cout if that sequence of integers is a palindrome of even size and writes no if it is not. Recall that a palindrome is a sequence that is the same when read from left to right or from right to left. So, the sequence 441263362144 is a palindrome, while the sequence 441267362144 is not