It doesn’t take much analysis to determine that the solution for Problem 7 is not very efficient. It would be much more efficient to write a new ADT method that copies a queue using its knowledge of...

It doesn’t take much analysis to determine that the solution for Problem 7 is not very efficient. It would be much more efficient to write a new ADT method that copies a queue using its knowledge of the ADT. Rewrite Problem 7 as a new ADT algorithm.

Using only the algorithms in the queue ADT, write an algorithm called catQueue that concatenates two queues together. The second queue should be put at the end of the first queue.