1. Give the peek algorithm (code) for a Stack that can hold 10 nodes. Include error checking, and assume that the array -theData- and the integer -top- are data members of the class -Stack-.

2. Give the algorithm for the structure -Queue- that keeps the front and rear "pointers" from progressing through all of memory (assume the Queue array has n elements).

Thank you!