EXERCISE#3 Estimate the overhead of inserting (adding) a new block, using the number of the necessary disk accesses, in an existing file using the contiguous, linked-list, and index allocation methods for the following cases: Contiguous Linked-List Index 1st sector Nth (NsM sector Use the following assumptions: (1) Use the same assumptions we used for EXERCISE #2. (2) The target file consists of M data blocks (M sectors). (3) Writing a sector requires the OS one disk access. (4) Each file directory fits to a disk sector. (5) For the index allocation method, the index fits to a disk sector. EXERCISE#4 Estimate the overhead of deleting an existing data bock (using "Big-O notation") from a file using the contiguous, linked-list, and index allocation methods for the following cases: Contiguous Linked-List Index 1st sector N-th (N M) sector Note: Use the same assumptions we used for EXERCISE #2 and #3. EXERCISE #5 Compare the contiguous, linked-list, and index storage-space (sectors) allocation methods for access speed. ContiguousLinked-List Index Reading a data block Inserting a data block Deleting a data block Reading an entire file Note: Compare by specifying: "best", almost best", "2nd best", "worst", and "depend" EXERCISE#3 Estimate the overhead of inserting (adding) a new block, using the number of the necessary disk accesses, in an existing file using the contiguous, linked-list, and index allocation methods for the following cases: Contiguous Linked-List Index 1st sector Nth (NsM sector Use the following assumptions: (1) Use the same assumptions we used for EXERCISE #2. (2) The target file consists of M data blocks (M sectors). (3) Writing a sector requires the OS one disk access. (4) Each file directory fits to a disk sector. (5) For the index allocation method, the index fits to a disk sector. EXERCISE#4 Estimate the overhead of deleting an existing data bock (using "Big-O notation") from a file using the contiguous, linked-list, and index allocation methods for the following cases: Contiguous Linked-List Index 1st sector N-th (N M) sector Note: Use the same assumptions we used for EXERCISE #2 and #3. EXERCISE #5 Compare the contiguous, linked-list, and index storage-space (sectors) allocation methods for access speed. ContiguousLinked-List Index Reading a data block Inserting a data block Deleting a data block Reading an entire file Note: Compare by specifying: "best", almost best", "2nd best", "worst", and "depend