Program 3 Chapter 5 3 4 of our book discusses the Adapter Design Pattern, which is a technique by which an existing data structure can be retooled to provide an im plementation of another abstraction That example is based on using a double ended queue (we'll see this soon) to provide the simpler abstractions of a stack and a queue For this problem, we want you to show how to implement a queue class using nothing other than two stack instances Rather than using our own version of the stack and queue, you should as sume that we are using the STL version of a stack This means that you can presume it has infinite capacity However, it also means that you cannot make any assumptions about the private representation of the stacks (that is, you cannot access the underlying array) You must use the stacks as tools based only on their public behaviors For concreteness, we ask that you model your answer to this problem in C syntax, using the following framework as the basis include template class queue private Do not use any data members other than the following two stacks std stack S1 std stack S2 public bool empty() const return (S1 empty() $2 empty() int size() const void push(const Object e) void pop() Object front() for simplicity, we'll ignore the const version of front() end of class queue Program 3 Chapter 5 3 4 of our book discusses the Adapter Design Pattern, which is a technique by which an existing data structure can be retooled to provide an im plementation of another abstraction That example is based on using a double ended queue (we'll see this soon) to provide the simpler abstractions of a stack and a queue For this problem, we want you to show how to implement a queue class using nothing other than two stack instances Rather than using our own version of the stack and queue, you should as sume that we are using the STL version of a stack This means that you can presume it has infinite capacity However, it also means that you cannot make any assumptions about the private representation of the stacks (that is, you cannot access the underlying array) You must use the stacks as tools based only on their public behaviors For concreteness, we ask that you model your answer to this problem in C syntax, using the following framework as the basis include template class queue private Do not use any data members other than the following two stacks std stack S1 std stack S2 public bool empty() const return (S1 empty() $2 empty() int size() const void push(const Object e) void pop() Object front() for simplicity, we'll ignore the const version of front() end of class queue

The Answer is in the image, click to view ...

Answered step by step

Verified Expert Solution

Link Copied!

Question

1 Approved Answer

Posted on Sep 12, 2024

Program 3 Chapter 5.3.4 of our book discusses the Adapter Design Pattern, which is a technique by which an existing data structure can be retooled

image text in transcribed

Program 3 Chapter 5.3.4 of our book discusses the Adapter Design Pattern, which is a technique by which an existing data structure can be retooled to provide an im- plementation of another abstraction. That example is based on using a double- ended queue (we'll see this soon) to provide the simpler abstractions of a stack and a queue. For this problem, we want you to show how to implement a queue class using nothing other than two stack instances. Rather than using our own version of the stack and queue, you should as- sume that we are using the STL version of a stack. This means that you can presume it has infinite capacity. However, it also means that you cannot make any assumptions about the private representation of the stacks (that is, you cannot access the underlying array). You must use the stacks as tools based only on their public behaviors. For concreteness, we ask that you model your answer to this problem in C++ syntax, using the following framework as the basis. #include template class queue { private: // Do not use any data members other than the following two stacks std::stack