A programmer has an algorithm that requires a java.util.List that provides an efficient
implementation of add(0, object), but does NOT need to support quick random access. What
supports these requirements?
A.
java.util.Queue
B.
java.util.ArrayList
C.
java.util.LinkedList
D.
java.util.LinearList
Explanation: