$($b$)$ Describe the LRU page replacement algorithm, assuming there are $3$ frames and the

page reference string is :

$7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1.$ Find the number of page faults that occur.