Consider a file currently consisting of $50$ blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk $I/O$ operations are required for indexed (single-level) allocation strategy ?
- $1$
- $101$
- $27$
- $0$