Assume that data you need to access/update is always specified by "offset address" in a file, which indicates how many bytes the target data is away from the beginning of the file. Which file organization (contiguous, linked-list or index) would vou choose to maximize efficiency in terms of speed of the data access (select the best file organization for each of the five cases below), when: (a) Data is rarely updated (almost no update) but frequently read in random order (the locations of the target data are random). (b) Data is added always at the beginning of files. (c) Data is rarely updated (almost no update) but frequently read in the sequential order from the beginning to the end of files (d) Data at random locations in a file is frequently updated. (e) Data is deleted always at the end of files. Note 1: No explanation is necessary for your solutions. Note 2: The term, "update", means modifying the content of data (but no deletion or addition of new data) The term, "access", means reading the data. Note 3: Do not assume that there is always some empty disk blocks before the first data block and after the last data block in a file