1.Consider a hierarchical file system in which free disk space is kept in a free space list.
a. Suppose the pointer to free space is lost. Can the system reconstruct the free
space list?
b. Suggest a scheme to ensure that the pointer is never lost as a result of a single
memory failure.
2. In UNIX System V, the length of a block is 1 Kbyte, and each block can hold a total of 256 block addresses. Using the inode scheme, what is the maximum size of a file?