Design a file system.

Designing a file system involves several key components:

1. Core Data Structures:

   • Inodes: Each file and directory is represented by an inode, which stores metadata like permissions, ownership, timestamps, and pointers to data blocks.
   • Data Blocks: These store the actual content of files.
   • Directory Entries: Directories are special files that map names to inode numbers. This allows for hierarchical organization.

2. File Types:

   • Regular Files: Store user data.
   • Directories: Special files containing directory entries.
   • Symbolic Links (Symlinks): Pointers to other files or directories, stored as special files containing the path to the target.

3. Operations:

   • File Creation/Deletion: Involves allocating/deallocating inodes and data blocks, and updating parent directory entries.
   • Read/Write: Accessing data blocks via inode pointers.
   • Directory Traversal: Following directory entries to navigate the file system hierarchy.

4. Printing Files for a Given Path:

   • To list files in a directory, we first resolve the given path to its corresponding inode.
   • If the inode represents a directory, we read its data blocks, which contain a list of name-to-inode mappings.
   • We then iterate through these mappings, retrieve the names, and present them as the list of files within that path.