You are to redesign the Unix V6 file system so that small files can be larger than

4Kbytes. Disk block addresses are 4 Bytes long (instead of 2 Bytes), disk block size is

4Kbytes (instead of 512 Bytes). Components nlinks, uid and gid are 2 Bytes long (instead

of 1 Byte) and size is stored in 6 Bytes (instead of 3 Bytes). Components actime and

modtime remain unchanged. Each I-node is to be stored entirely within one disk block.

Thus, an I-node cannot span (be split across) two disk blocks. For this situation, find

(a) Find the smallest size of I-nodes.

(b) Find the maximum number of elements of addr array.

(c) Compute max size of small file.

Please explain all answers