The common computer file system is like a tree where each node represents a directory that contains 0 or more files, and 0 or more links into subdirectories.

To implement such a file system, a data structure there called THE LEFTMOST-CHILD, RIGHT-SIBLING is often used. The leftmost child refers to the first subdirectory of a node, and the rightmost child refers to the next directory on the same level as the node.

In this case, the root directory has theee files (P,Q,R) and three subdirectories (A,B,C). Note that directory names can be repeated if they do not appear as siblings. Similarly, file names can be repeated if they do not appear in the same directory.

The PRIMARY TASK of this question is to design, implement, and test a file system using the LEFTMOST-CHILD, RIGHT-SIBLING as the data structure and where behaviour of the file system is defined by the methods in figure 2. Each method in FileSystem is worth 7 marks, except the constructor is worth 3 marks.

11:23 AM e 10 Figure 2 class Node private string directory private List