1)Given that main memory is composed of only three page framesfor public use and that a seven-page program (with pages a, b, c,d, e, f, g) that requests pages in the following order: a, b, c, b,d, a, e, f, b, e, d, f a)Using the FIFO page removal algorithm,indicate the movement of the pages into and out of the availablepage frames (called a page trace analysis) indicating each pagefault with an asterisk (*). Then compute the failure ratio andsuccess ratio. b)Using FIFO again, increase the size of memory soit contains four page frames for public use. Using the same pagerequests as above, do another page trace analysis and compute thefailure and success ratios.
2)Given the following Segment MapTables for two jobs:
SMT for Job 1 Segment Number | Memory Location |
0 | 4096 |
1 | 6144 |
2 | 9216 |
3 | 2048 |
4 | 7168 |
SMT for Job 2 Segment Number | Memory Location |
0 | 2048 |
1 | 6144 |
2 | 9216 |
a.  Which segments, if any,are shared between the two jobs?
b.  If the segment nowlocated at 7168 is swapped out and later reloaded at 8192, and thesegment now at 2048 is swapped out and reloaded at 1024, what wouldthe new segment tables look like?
