solve it clearly please

1. What are the three strategies for selecting a free hole from the set of available holes? 2. List the three different times at which address binding may occur. 3. Explain memory protection. Draw and explain Hardware support for relocation and limit registers to achieve memory protection 4. Given five fixed memory partitions of 100Kb,500Kb, 200Kb,300Kb, and 600Kb (in order), how would the firstfit, best-fit, and worst-fit algorithms place processes of 212 Kb,417Kb,112Kb, and 426Kb (in order)? Which algorithm makes the most efficient use of memory? 5. Define paging, segmentation, segmentation architecture, and segmentation with paging. 6. Why paging is used by the operating system? state any two reasons why page fault occurs. 7. How many entries are in a two-level page table with a 20-bit page number? What is an alternative to hierarchical paging for large ( >32 bits) address sizes? 8. Explain Address Translation Scheme, Paging Hardware with TLB