Assume that we already have the i-node for a given le in memory, and that a read request arrives for byte 115,200 of that le. How many disk reads (i.e., individual block requests) must be performed to satisfy that request? Explain.

Consider the following parameters of an i-node based, UFS-like file system: Blocks are 512 bytes large . Block pointers are 64-bits (8 bytes) wide . Each i-node consists of 8 direct pointers, 2 single indirect pointers, and 1 double indirect pointer Consider the following parameters of an i-node based, UFS-like file system: Blocks are 512 bytes large . Block pointers are 64-bits (8 bytes) wide . Each i-node consists of 8 direct pointers, 2 single indirect pointers, and 1 double indirect pointer