Please explain your answer

Question 5 - Free Space Management Free space management involves capturing a description of the computer's using a data structure, storing this data structure in memory, and OS support to rap this structure to determine an appropriate location for implementation is very important when we scale up the number of operatior required to perform. free memory idly use new memory allocations. An efficient s the OS is Consider the use of a linked list for a free s placing th pace list where each node is represented by e following structure in the header of the memory chunk: typedef struct _node t int size; struct node_t *next; node_t; Consider the following free space list: head- NULL size-10 size-5size-8 size-32size-1 size-7 Consider the next fit allocation strategy. For this free list above, how many comparis operations must be performed to identify a free chunk of 30-bytes? on After the last free space identification, the chunk is split and the remaining free space is returned to the free space list. Now, consider the next fit allocation strategy. After findin a free space for the previous request, how many comparisons are required to identify a free chunk of 10-bytes? Now, after the last free space identification the chunk is split and the remaining free space is returned to the free space list. Now consider each of the following free space allocation strategies. How many comparisons are required on the updated free space list to find a free chunk of 2 bytes using: (a) best fit: (b) worst fit: (c) first fit