1. Assuming the most efficient implementation of a Singly Linked List Stack, what is the cost of the Push() operation?

a. O(1)

b. O(3)

c. O(log n) d. O(n)

2. Assuming the most efficient implementation of a Singly Linked List Queue, what is the cost of the Enqueue() operation?

a. O(3)

b. O(1)

c. O(n)

d. O(log n)

3. If an algorithm is expressed using the equation below, write the complexity using "Big Oh" notation.

F(n) = 15n2 + 45n

4. Assuming the most efficient implementation of a Singly Linked List Queue, what is the cost of the Dequeue() operation?

a. O(3)

b. O(n)

c. O(log n)

d. O(1)