Suppose list is a LinkedList that contains 1 million int values. Analyze the following code:

Question

```
A:
for (int i = 0; i < list.size(); i++)
sum += list.get(i);

B:
for (int i: list)
sum += i;
```
a. Code fragment A runs faster than code fragment B.
b. Code fragment B runs faster than code fragment A.
c. Code fragment A runs as fast as code fragment B.

Answer 1

b Becuase code fragment B uses an iterator to traverse the elements in a linked list.