Consider a memory of size 8KB (8192 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: 500, P2: 600, P3: 1300, P4: 2000, P5: 100, P6: 200 Assume that the initial state of the free list is as shown below (BA is the base address and Sz is the size of each free space): BA:0; Sz: 1100-BA: 1200; Sz: 600 BA: 2000; Sz: 1800 BA: 6000; Sz 400 Question 7 3 pts If P6 is allocated, what is the BA? The updated free list is: BA: - BA Question 8 3 pts If P1 is allocated, what is the BA? The updated free list is: BA: BA: Sz: -BA