Rewrite the stack Pop algorithm presented in this chapter (see textbook page 134) assuming that top was initialized to 0 instead of 1.

1. if(top == -1)

2. return null; // **underflow error**

3. else

4. {topLocation = top;

5. top=top -1;

6. return data [topLocation]; // return a shallow copy

7. }