Problem 1 A process contains eight virtual pages on disk and is assigned a fixed allocation of four page frames in the main memory. a) Show the successive pages residing in the four frames using the LRU (least recently used) policy. c) Repeat for the optimal algorithm How many page table hits were there? How many misses? How many page table hits were there? How many misses? How many misses were unavoidable?. Explain the result (1 sentence) ******* How many misses were unavoidable?. Explain the result (1 sentence) Problem 1 A process contains eight virtual pages on disk and is assigned a fixed allocation of four page frames in the main memory. a) Show the successive pages residing in the four frames using the LRU (least recently used) policy. c) Repeat for the optimal algorithm How many page table hits were there? How many misses? How many page table hits were there? How many misses? How many misses were unavoidable?. Explain the result (1 sentence) ******* How many misses were unavoidable?. Explain the result (1 sentence)