2) Consider the following page reference for a virtual memory system in which physical memory has exactly 3 frames: 1,0,6,0,1,2,0,4,2,1 For each of the following page replacement algorithms, show which references will cause page faults and show the contents of the 3 frames at the time of each fault. Assume that the frames are initially empty. You do not need to show the first 3 faults that are caused by demand paging. a) Least Recently Used b) Optimal c) Second Chance