10 (13.30) Figure 13.9 shows an inode data structure. Suppose a file system that uses this structure has filled up the blocks stemming from the doubly indirect pointers. How many disk accesses will it take to write one more byte to the file? Assume that the inode and free block bitmap are
OR
OR