Given the memory map in the figure, where areas are not shaded indicate free regions. Assume that the following events occur: (1 Mark) Step L) ESTEER ii) ) lv) (v) Event vi) P5 arrives P6 arrives P7 arrives PB arrives P5 leaves p9 arrives Required contiguous memory size (k) 12 45 19 15 P1 free 30 K P2 -free 20 K P3 -free- 50 K P4 15 a. Draw the memory maps after steps (iv) and (vi) using first fit and worst fit allocation techniques without compaction. b. Draw the same memory maps as in part (a) if compaction is performed whenever required. Also, show the maps after each compaction. Given the memory map in the figure, where areas are not shaded indicate free regions. Assume that the following events occur: (1 Mark) Step L) ESTEER ii) ) lv) (v) Event vi) P5 arrives P6 arrives P7 arrives PB arrives P5 leaves p9 arrives Required contiguous memory size (k) 12 45 19 15 P1 free 30 K P2 -free- 20 K P3 -free- 50 K P4 15 a. Draw the memory maps after steps (iv) and (vi) using first fit and worst fit allocation techniques without compaction. b. Draw the same memory maps as in part (a) if compaction is performed whenever required. Also, show the maps after each compaction.