Operating systems

	(b).	A process references five pages, A, B, C, D, and E, in the following order: A, B, E, B, A, C, B, A, B, C, D, C, D, E, D, A Assume the process is allocated with three page frames in the main memory and the frames are initially empty.
		(i).	Perform a page trace analysis indicating page faults with asterisk (*) using First In First Out (FIFO) page removal algorithm. Then compute the success and failure ratios.
		(ii).	Repeat 1(a)(i) by using the Least Recently Used (LRU) page removal algorithm.
		(iii).	Compare the two success ratios and comment on the effectiveness of page removal algorithms.