Assume a main memory with four page frames (frame A through frame D). Assume that the sequence of pages requested by a process is as shown below. 1, 0, 8, 3, 1, 3, 4, 6, 1, 5, 3 For each reference in the above sequence, identify whether it will cause a page fault (F) or will result in a page hit (H), when using the least recently used page replacement algorithm. Use the table provided for your solutions - use the Status column to indicate F or H and the Page Frame column to indicate the page frame into which the page has been loaded. Assume that all page frames are initially empty. Note: the first few entries are already filled out for your reference.Page Tras DCCIT Note: the first few entries are already filled out for your reference. Page Status Page Frame 1 F A 0 F B 8 F 3 F D 1 [ Select ] [ Select ] 3 [ Select ] [ Select] 4 [ Select ] [ Select ] 6 [ Select ] [ Select ] 1 [ Select ] [Select ] 5 [ Select ] [Select ] 3 [ Select ] [ Select ]