On the original UNIX file system, we are reading the file /one/two/three. txt. All the directories fit in a single block each. 1. Describe and count the number of disk reads involved in reading the file. Assume no disk cache/buffer is used.
2. How does FFS improve performance over the basic UNIX file system? (1 point) disk cache/buffer is used.
3. How does using the open(...) system call help the performance of the file system.
4. Lets create a symbolic link called three in directory one pointing at three. txt - Assume that three has a single block of data. List all i-nodes that are modified or created.
5. Explain two specific scenarios of problems that happen if the system crashes in the middle of part 4. What is their effect?