1. What modifi cations to the previous programming problem are required to fi nd a least-cost trip for each request? How can you incorporate time considerations into the problem? 2. What is an...

1. What modifi cations to the previous programming problem are required to fi nd a least-cost trip for each request? How can you incorporate time considerations into the problem?

2. What is an array-based stack of integers? Write a C++ class for such a stack of integers.

3. Implement a constructor, copy constructor, and destructor for the ADT stack.