Given Page requests: Reference string: $4,3,4,1,2,4,1,2,3,2,1,1$

Draw the memory allocation states as the above pages are being referenced for the given scheduling algorithm $($given the respective number of page frames$).$ What is the number of page faults for each algorithm $?$AGING

Assume there are $3$ page frames of physical memory

Also assume there are $4$ bits in the counter for each page