Consider five memory partitions of size $100 \text{ KB }, 500 \text{ KB }, 200 \text{ KB }, 450 \text{ KB and } 600 \text{ KB }$ in same order. If sequence of requests for blocks of size $212 \text{ KB }, 417 \text{ KB }, 112 \text{ KB }, 426 \text{ KB and } 280 \text{ KB }$ in same order come and partitioning can be done in block, then which of the following algorithm satisfy all the block requests?
- Best Fit algorithm
- First Fit algorithm
- Both next fit and best fit results in same
- None of the above
Answer given by ME: Option $(B)$
My answer: Option $(D)$