Consider a memory of size 16KB (16,384 bytes) that allows dynamic, variable sized partitioning among processes and uses a linked list to keep track of free spaces (hereafter referred to as the free list) in the memory at any given time. Assume that there are 6 processes and assume that their memory size requirements (in bytes) are as given below:

P1: 900, P2: 300, P3: 8192, P4: 250, P5: 500, P6: 800

Assume that the initial state of the free list is as shown below, where BA is the base address and Sz is the size of the free space:

BA: 500; Sz: 1600 ? BA: 5000; Sz: 350 ? BA: 7250; Sz: 1000 ? BA: 9000; Sz 1800

Assume that the best fit policy is used for partition placement. Identify the base address of the region to which each of the following processes will be allocated, assuming that they are allocated in the order in which they are listed below and show the updated free list state after each allocation. If a partition cannot be allocated due to the state of the free list, simply indicate this as your answer.

a) P6

If P6 is allocated, what is the BA?

The updated free list is:

BA: ; Sz: ? BA: ; Sz: ? BA: ; Sz: ? BA: ; Sz

b) P2

If P2 is allocated, what is the BA?

The updated free list is:

BA: ; Sz: ? BA: ; Sz: ? BA: ; Sz: ? BA: ; Sz