Please post the answer as soon as possible. Thanks in advance!!

QUESTION 3 [10 MARKS] (a) One of the methods to manage index block size dilemma in indexed allocation is through linked scheme by index block structure. Figure below shows the directory contains the name of the file and the address of the index block. Assume the file blocks as 10, 24, 36, 11, 15, 29, 30, 33 with each block can only stores 5 block addresses. Directory File DATA Index Block 10 Show how the linked scheme allocates the file blocks for DATA file by determining the value for a) 1) as in the figure below. Block a) Block b) c) h) i) j) k) 1) f) g) The value of block a) is The value of block b) is = The value of c) is = The value of d) is = . > The value of e) is = The value of f) is = > The value of g) is = . The value of h) is = The value of i) is = > The value of j) is = The value of k) is = The value of I) is = (b) One of the techniques for a file system to maintain free-space list in order to track available blocks is through bit map. Assume that there are 4 bits per word and the bit map is as in the figure below. Show how the address of the first free block is calculated. Block o 1 2 3 4 5 6 7 8 9 11 12 13 14 15 No Bit 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 Offset 0 1 2 3 0 1 2. 3 0 2 3 1 2 3 map 1 o = (Number of bits per word * number of O-values words) + offset of first l bit + =