P4(15 points) Implement a stack using two queues. The implemented stack should support the following functions (push, top, pop, empty). Implement the MyStack class: void push(int x) pushes element x to the top of the stack void popo removes the element on the top of the stack int top( return the element on the top of the stack bool empty() return true if the stack is empty, false otherwise MyStack* obj = new MyStack() ; add element: 1 add element : 3 get element: 3 obj->push(1) ; (= => > the top value is: 3 obj->push(3) ; pop out element : 3 add element : 5 get element: 5 int resl = obj->top() ; == = > the top value is: 5 cout the top value is: " pop() ; pop out element: 1 zazz=> is myStack empty? : 1 obj->push (5) ; D: \\TA\\ESE224-2022\\Lab\\Labe9\\S To automatically close the cor int res2 = obj->top(); le when debugging stops. Press any key to close this w cout the top value is: " pop() ; obj->pop() ; bool res3 = obj->empty() ; cout is myStack empty?: "