1) In the array implementation of a stack, why should items and top be specified as private?

2) Give an example of when a link based implementation of a stack is a better choice?

3)In an array based implementation of a stack, why is the bottom of the stack the first element of the array?

4) In a list, what is the range of entry number for which it is legal to insert a new entry?

5) when an entry is removed from a list, what is an additional consequence of that removal?

6) write the code segment that inserts into a linear linked list the node to which newPtr points between the two nodes pointed to by the variables prevPtr and curPtr.

7) When choosing between two algorithms, under what conditions can the efficiencies of the algorithms be ignored?