EXERCISE #1 ompare the contiguous, linked-list, and index storage-space (sectors) allocation methods for the following three performance metrics: speed, reliability, and storage-space utilization. Index Contiguous ousLinked-List Speed (read an entire file) Reliability Space Utilization Note 1: Compare the three methods by: "best", "almost best", "2nd best", and "worst". Note 2: It is possible for more than one method to have the same ranking EXERCISE #2 Estimate the overhead of reading an existing data bock, using the number of the necessary disk accesses, in a file using the contiguous, linked-list, and index allocation methods for the following cases: Contiguous Linked-List Index 1st sector N-th sector Use the following assumptions: (1) One data block is the same size of a hard drive sector. (2) Reading a sector requires the OS one disk access. (3) The index has been loaded to the memory (no disk access needed for accessing the i (4) The directory of the target file has been loaded to the memory (no disk access needed for ndex) accessing the file directory). (5) For contiguous allocation, the OS can "spot" (-"calculate) the target sector from the 1st sector of a target file