True/False(Java)

1. In a linked-chain implementation of the Stack ADT, the first node references the stacks top entry.

2. In an array-based implementation of the Stack ADT, it is more efficient to have the first array location reference the top of the stack.

3. In an array-based implementation of the Stack ADT, the cost of doubling the array size is amortized over all additions to the stack.

4. A vector will grow in size as needed.

5. A vector is analogous to a resizable linked-chain.

6. A vector is manipulated with methods.

7. A vectors entries are indexed beginning with 0.

8. In a vector-based implementation of the Stack ADT, the most efficient place to maintain the top

   entry of a stack is in the vectors first element.

9. Using a resizable array to implement the stack ADT avoids the condition where a stack is too full

   to accept another entry.

10. In an array-based implementation of the Stack ADT, spreading the cost of the push operation

    when the stack is full yields a performance of O(n).