Consider the usual algorithm for determining whether a sequence of parentheses is balanced.

The maximum number of parentheses that appear on the Stack AT ANY ONE TIME when the algorithm analyzes: (()(())(())) is:

1. 1
2. 2
3. 3
4. 4 or more

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a:

1. Queue
2. Stack
3. Tree
4. Linked list

Assertion (A): The major implementation of using a data structure is to manage the storage of data in the memory efficiently.

Reasoning (R): Data structure refers to the way memory is allocated for holding data using minimum space. It leads to faster data access during the execution of the program.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion (A): While working with Stacks, the program should check for Overflow condition before executing push operation and, similarly, check for Underflow before executing pop operation.

Reasoning (R): In Stack, Underflow means there is no element available to remove and Overflow means no further element can be added to it.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.