Implement the ADT pile that you specified in Programming Problem 6 of Chapter 1 by using an array.

Programming Problem 6:

Imagine a pile of books on your desk. Each book is so large and heavy that you can remove only the top one from the pile. You cannot remove a book from under another one. Likewise, you can add another book to the pile only by placing it on the top of the pile. You cannot add a book beneath another one. If you represent books by their titles alone, design a class that you can use to track the books in the pile on your desk. Specify each operation by stating its purpose, by describing its parameters, and by writing a pseudo code version of its header. Then write a C++ interface for the pile's methods. Include javadoc -style comments in your code.