Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string? A) 4, 1, 3
B) 3, 1, 4
C) 4, 2, 3
D) 3, 4, 2