I need help with this question:

1 - Answer the following questions about a program containing 512 bytes and an operating system using a page frame size of 200 bytes.

a) How many page frames are necessary to store the entire program in memory?

b) How many bytes of external fragmentation exists when the entire program is stored in memory?

c) How many bytes of internal fragmentation exists in page frame containing the first page of the program?

d) How many bytes of internal fragmentation exists in page frame containing the last page of the program?

e) On which page would you find the program instruction at byte 256?

f) What is the displacement within the page of the program instruction at byte 256?

2 - Refer to this page request sequence A,C,B,D,A,C,E,A,C,B,D,E to answer the following questions.

a) Perform a page trace analysis using three (3) page frames and the First-In First-Out (FIFO) page replacement algorithm.

b) Perform a page trace analysis using three (3) page frames and the Least Recently Used (LRU) page replacement algorithm.

c) Which page replacement algorithm performed best for this page request sequence?

d) Will one page replacement algorithm always perform better than the other?

e) Perform a page trace analysis using four (4) page frames and the First-In First-Out (FIFO) page replacement algorithm.

f) Did increasing the number of available page frames increase or decrease the Success Rateof the First-In First-Out (FIFO) page replacement algorithm? Explain the cause of this increase or decrease.

g) What is the fewest number of page faults that could occur using either the First-In First-Out (FIFO) or Least Recently Used (LRU) page replacement algorithms?

Thank you.