Explain the following page replacement strategies: Optimal algorithm, Not recently used algorithm, First$-$in first$-$out $($FIFO$)$ algorithm, Second$-$chance algorithm,

Clock algorithm, Least recently used $($LRU$)$ algorithm, Working set algorithm, and WSClock algorithm. Especially describe what makes them good and also what

can make each problematic.