Consider the following two data structures for storing several million words. I. An array of words, not in any particular order
II. An array of words, sorted in alphabetical order
Which of the following statements most accurately describes the time needed for operations on these data structures?
A. Finding the first word in alphabetical order is faster in I than in II.
B. Inserting a word is faster in II than in I.
C. Finding a given word is faster in II than in I.
D. Finding the longest word is faster in II than in I.