please do all the problems

A file handle is O a pointer to the file user directory O a pointer to the physical address a file a pointer to the logical address of a file a pointer to an entry int the per-process file system table Question 11 (1 point) The system-wide open-file table contains a copy of the file control block of each open file O a pointer to the file control block of each open file only the names of each open file only the names and addresses of each open file Question 12 (1 point) When a new file is added to the directory, it is being appended at the end of it. True False Question 13 (1 point) What is the main drawback of using a hash table to manage a file directory? slow read/write operations difficult insertion and deletion fixed size dependence on linear list structure Question 14 (1 point) The performance of an allocation method is determined only by the allocation algorithm used. True False Question 15 (1 point) A free space list may be implemented as various structures, not only as a list. True False Question 16 (1 point) Which free space management approach takes advantage of the fact that multiple contiguous blocks may be allocated or free simultaneously? Ogrouping linked list space maps counting Question 17 (1 point) Double caching improves memory usage efficiency and prevents file corruption. True False Question 18 (1 point) Linked allocation allows for reconstructing the entire file from data blocks, if links between blocks are provided. True False Question 19 (1 point) A journaling system records each metatdata update to the file system as a transaction. True False Question 20 (3 points) Match the optimal allocation strategy to the type of file for which allocation is requested. File is large and is usually accessed randomly 1. Contiguous File is large and is usually accessed sequentially 2. Linked File is relatively small and is 3. Indexed usually accessed sequentially