Consider the following code. Which implementation of List should would make this code takes O$($N$)$ time to run, where N is the size of the list?

public static void printList$($List list$)\{$

for $($int i $=0$; i $<$ list.size$()$ ; i$++)\{$

Character c $=$ list.get$($i$)$;

System.out.println$($c$)$;

$\}$

$\}$

Group of answer choices

ArrayList

Singly Linked List

Doubly Linked List