Consider a UNIX file system with 12 direct pointers, 1 indirect pointer, 1 double-indirect pointer, and 1 triple-indirect pointer in the i-node. Assume that disk blocks are 8K bytes and that each pointer to a disk block requires 4 bytes.

5. Calculate the number of pointers / block.

6. What is the largest possible file that can be supported with this design?

a. Show the expression to get full credit (i.e., you shouldn't calculate the final numeric answer).

b. Draw a figure to illustrate the case of the larger file.