the way I understand the project is that it starts loaded in with the first 2 processes (page numbers 0-7) but because there are 16 pages in disc there is also a copy of process 0 and 1 in disc so instruction 0: bring in least recently used page into RAM from process 0 - currently in disc there are 4 pages in process 0 all with page num 99 and and time step 0 since there is no space in RAM we evict the smallest time step (process 0, time step 0, page num 0) now we add (process 0, time step 0, page num 0) from the disc now we increment the time step this would repeat until the 5th 0, I'm not quite sure what would happen here because in the given sample output they demonstrate that the time step can be greater than 1 but we are also not supposed to modify the disc so I am not sure how this is possible