consider five memory partitions of size $100$ kb$,500$ kb$,200$ kb$,450$ kb and $600$ kb in same order. If sequence of requests for blocks of size $212$ kb$,417$ kb$,112$ kb and $426$ kb in same order comes, then which of the following algorithm makes the efficent use of memory? A best fit algorithm B$.$First fit algorithm C$.$Next fit algorithm