The following sequence of requests for program words is taken from a 460-word program: 10, 11,104, 170, 73, 309, 185, 245, 246, 434, 458, 364. Main memory can hold a total of 200 words forthis program, and the page frame size will match the size of the pages into which the program hasbeen divided.Calculate the page numbers according to the page size and divide by the page size to get the pagenumber. The number of page frames in memory is the total number, 200, divided by the page size.For example, in problem (a) the page size is 100, which means that requests 10 and 11 are on Page0, and requests 104 and 170 are on Page 1. The number of page frames is two.a) Find the success frequency for the request list using a FIFO replacement algorithm and apage size of 100 words (there are two page frames).b) Find the success frequency for the request list using a FIFO replacement algorithm and apage size of 20 words (10 pages, 0 through 9).c) Find the success frequency for the request list using a FIFO replacement algorithm and apage size of 200 words.d) What do your results indicate? Can you make any general statements about what happenswhen page sizes are halved or doubled?e) Are there any overriding advantages in using smaller pages? What are the offsetting factors?Remember that transferring 200 words of information takes less than twice as long astransferring 100 words because of the way secondary storage devices operate (the transferrate is higher than the access [search/find] rate).f) Repeat (a) through (c) above, using a main memory of 400 words. The size of each pageframe will again correspond to the size of the page.g) What happened when more memory was given to the program? Can you make some generalstatements about this occurrence? What changes might you expect to see if the request listwas much longer, as it would be in real life?h) Could this request list happen during the execution of a real program? Explain.i) Would you expect the success rate of an actual program under similar conditions to behigher or lower than the one in this problem?