Java Foundations

Using Big-O notation, give the running time of the linked list implementations of each of the following stack operations. Assume an optimal implementation.

(A) push(item)

(B) pop()

(C) peek()

(D) size()

(E) isEmpty()

(F) clear()

Multiple Choice Options:

a.

O(1)

b.

O(log n)

c.

O(n)

d.

O(n log n)

e.

O(n^2)

f.

O(n^3)

g.

O(n!)