Suppose you have a variable-division memory system (no compression) that in at any given time it has five 'holes' for allocating memory to new processes, with corresponding hole sizes O1:50K, O2:30K, O3:200K, O4:16K and O5:30K. Then appear the following, in order, processes requesting memory to execute: A:20K, B:30K, C:10K, D:100K and E:60K. Consider that every time a process is placed in a hole, the rest of the segment of the hole that remains free can be used for the placement of other processes. Which of the following statements is correct? a) With the best fit algorithm, hole O1 will be fully used. b) With the best fit algorithm, process C will be placed in hole O4. c) With the worst fit algorithm, process E will be out of memory (it will not i.e. placed in any of the available holes). d) With the worst fit algorithm, processes C and D will be placed in different holes.