Suppose list$1$ is an ArrayList and list$2$ is a singly LinkedList. Analyze the following code:

A:

while $($list$1.$size$()>0)$

list$1.$remove$($list$1.$size$()-1)$;

B:

while $($list$2.$size$()>0)$

list$2.$removeLast$()$;

Code fragment A runs faster than code fragment B$.$

Code fragment B runs faster than code fragment A$.$

Code fragment A runs as fast as code fragment B$.$