Given a file of data in random order, where the size of the file is n = 2k. Suppose you want to find the largest item in the file. How would you go about finding it? What is the cost (think O(f(n))) of your solution? Justify your answer. Solutions that are more efficient are worth more points.

In specifying the ADT, it is important for the name to reflect the implementation

True or false

Suppose you have to store employee records for your employer, the largest company in the state of Maryland. The primary key is the Social Security number. You need to primarily access individual records, but occasionally expect to need to print out the file for an employee directory. Your coworker wants to hash the records by using division on the primary key - stripping off the first five digits as the address, with linear probing to resolve collisions. Tell your coworker three reasons all in support of his idea OR all against his idea.