Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory $\textsf{foo}$.
Which of the following operations will necessarily require a full scan of $\textsf{foo}$ for successful completion?
- Creation of a new file in $\textsf{foo}$
- Deletion of an existing file from $\textsf{foo}$
- Renaming of an existing file in $\textsf{foo}$
- Opening of an existing file in $\textsf{foo}$