public static void copy$($List l$1)\{$

$$List l$2=$ new List$<>()$;

$$int n $=$ l$1.$size$()$;

$$for$($ int i$=0$; i $<$ n; i$++)\{$

$$ int next $=$ l$1.$remove$(0)$;

$$ l$2.$add$($next$)$;

$\}$

$\}$

The above method is

Question $7$ options:

about the same speed $($in expectation$)$ independent of whether l$1$ and l$2$ are both ArrayLists or Skiplists

much faster $($in expectation$)$ when l$1$ and l$2$ are ArrayLists$$

much faster $($in expectation$)$ when l$1$ and l$2$ are Skiplists