Rewrite operators push and pop for a stack of integers. Also, write a new function retrieve that accesses the element at the top of the stack without removing it.

For the search function in Fig. 7.14, what happens if:

a. the last ID stored matches the target?

b. several IDs match the target?