Suppose list $1$ is a MyArraylist and list$2$ is a MyLinkedList. Both contains $1$ milton double values. Analyre the following code:

for $($int $1=0$;$1<mn\; id="EditorElement\_9953521">1</mn>$ ist$1.$size$()$; $i++$ sum $t=$ list$1,$get$($i$)$;

sum to list$1.$get$($i$)$;

B:

for $($int $i=0$;$i$ list$2.$sizeo$)$; $i++$ sum $+=$ list$2.$get$($i$)$;

sum $+=$ list$2.$get $(i)$;

Code fragment $B$ is more efficient that code fragment $A.$

Code fragment $A$ is as efficient as code fragment $B.$

Code fragment $A$ is more efficient that code fragment $B.$