Suppose list$1$ is an ArrayList and list$2$ is a LinkedList. Both

contains $1$ million double values. Analyze the following

code:

A:

for $($int $i=0$;$i<mn\; id="EditorElement\_362295">1</mn><mn\; id="EditorElement\_362296">0</mn><mn\; id="EditorElement\_362297">0</mn><mn\; id="EditorElement\_362298">0</mn><mn\; id="EditorElement\_362299">0</mn><mn\; id="EditorElement\_362300">0</mn>$;$i++)$

list$1.$ add$($i$)$;

B:

for $($int $i=0$;$i<mn\; id="EditorElement\_362216">1</mn><mn\; id="EditorElement\_362217">0</mn><mn\; id="EditorElement\_362218">0</mn><mn\; id="EditorElement\_362219">0</mn><mn\; id="EditorElement\_362220">0</mn><mn\; id="EditorElement\_362221">0</mn>$;$i++)$

list$2.$ add$($i$)$;

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

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

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