In an array, elements are stored in (a)   memory locations.

Each node in a singly linked list contains data and a (a)   to the next node.

The last node of a linked list stores (a)   as its next pointer value.

When stack is empty and pop is attempted, (a)   occurs.