Using a three frame memory and the following sequence of page requests show the page hits and faults and the final state of the memory in each of the following algorithms

a$.$ FIFO algorith

b$.$LRU with stack replacement

c$.$Optimal algorithm

$\backslash$table$[[3,2,3,0,8,4,2,5,0,9,8,3,2,5,8,4,2,3,0,2]]$