Assertion (A): The First-Fit memory allocation algorithm is generally faster at executing requests than the Best-Fit algorithm.
Reason (R): First-Fit terminates its search loop as soon as it identifies the very first free memory block large enough to host the incoming process.
Assertion (A) is True: First-Fit is generally faster than Best-Fit because it scans the memory free list only until it finds the first available block that fits, whereas Best-Fit searches the entire list to find the block closest in size to the requested memory.
Reason (R) is True: First-Fit allocates the memory block by stopping its search as soon as it encounters the first free block that is large enough to accommodate the incoming process.
Relationship between Assertion and Reason: Reason (R) correctly explains why Assertion (A) is true—because First-Fit stops searching immediately upon finding the first suitable block, it saves processing time compared to algorithms that evaluate the entire list, making it faster overall.