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.public int compareTo(Object o){/*more code here*/}
B.public int compareTo(Score other){/*more code here*/}
C.public int compare(Score s1,Score s2){/*more code here*/}
D.public int compare(Object o1,Object o2){/*more code here*/}

A.210
B.211
C.321
D.322
E.Compilation fails.
F.An exception is thrown at runtime.

A.4321
B.0000
C.An exception is thrown at runtime.
D.Compilation fails because of an error in line 18.