3) Consider the following page replacement algorithms: FIFO (first in first out), LRU (least recently used), OPT (optimal replacement), and 2nd chance. Logical memory has 10 pages (pages 0..9 ), while physical memory consists of 4 frames (frames 0..3 ). The page reference string begins with 5, 3, 8, 4 to fill the four frames. Each part begins from this same initial point. On your solution page, show the 2 frame traces for each part. For 2nd chance, also show the reference bit values. Each reference bit value is indicated by a 1 or 0 in parentheses. a) Continue the page reference string with at most 4 additional terms where LRU will result in strictly fewer page faults than FIFO