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.

The correct answer is C.

Explanation:

Finding a given word requires the search operation. The search operation is faster in a sorted array compared to an unsorted array. In a sorted array the binary search method is used which runs on logarithmic time while in an unsorted array, there's no other way than linear search which takes O(n) time on the worst case where the required word is not in the array.

b. related objects

explanation:

data is stored in related objects in an access database.

plot immersion i am not fully sure with it though