Assume that a file named file.txt is stored contiguously on disk and each cluster is 4 KB. Consider the following directory entry pointing to the file file.txt. Fill in all the blank FAT entries with proper values in the figure below, particu[1]larly the missing index numbers for the entries and their stored values. Assume a value of 0xf in a FAT entry indicates the end of chain of clusters occupied by a file. (Note that in the real FAT file system, an entry may use multiple bytes, for example each entry uses 2 and 4 bytes (16 and 32 bits) for FAT16 and FAT32, respectively. The value of each entry can be stored in different ways, mainly big endian and little endian, depending on which computing system you use, Big-Endian machine or Little-Endian machine; we are simply using the actual value for sim[1]plicity) .Directory entry FAT entry index File allocation table (FAT)