Convert the stack into a queue in c++ and must have matching example testin code and output as shown on next lines Example Testing Code: Stack S; int tmp; S.push(5); S.peek(tmp); cout << tmp << endl; S.push(33); S.push(1); S.push(7); S.peek(tmp); cout << tmp << endl; S.push(33); S.push(12); S.display( cout ); S.pop( ); S.display( cout ); S.push(14); S.display( cout ); S.pop( ); S.pop( ); S.display( cout ); S.pop( ); S.pop( ); S.display( cout ); S.peek(tmp); cout << tmp << endl; Example Testing Output: 5 7 12 33 7 1 33 5 33 7 1 33 5 14 33 7 1 33 5 7 1 33 5 33 5 33 #include #include using namespace std; // Stack implementation class Stack { private: vector data; public: void push(int val) { data.push_back(val); } void pop() { if (!data.empty()) { data.pop_back(); } } void peek(int& val) { if (!data.empty()) { val = data.back(); } } void display(ostream& os) { for (int i = data.size() - 1; i >= 0; i--) { os << data[i] << " "; } os << endl; } }; int main() { Stack S; int tmp; S.push(5); S.peek(tmp); cout << tmp << endl; S.push(33); S.push(1); S.push(7); S.peek(tmp); cout << tmp << endl; S.push(33); S.push(12); S.display(cout); S.pop(); S.display(cout); S.push(14); S.display(cout); S.pop(); S.pop(); S.display(cout); S.pop(); S.pop(); S.display(cout); S.peek(tmp); cout << tmp << endl; return 0; }.