Q:Evaluate the banker’s algorithm for its usefulness in an OS.Q:Why is the capability to relocate processes desirable?Q:Why is it not possible to enforce memory protection at compile time?Q:What are some reasons to allow two or more processes to all have access to a particular region of memory?Q:In a fixed-partitioning scheme, what are the advantages of using unequal-size partitions?Q:What is the difference between internal and external fragmentation?Q:What are the distinctions among logical, relative, and physical addresses?Q:What is the difference between a page and a segment?Q:Section 2.3, we listed five objectives of memory management, and in Section 7.1, we listed five requirements. Argue that each list encompasses all ofQ:Consider a dynamic partitioning scheme. Show that, on average, the memory contains half as many holes as segments.Q:To implement the various placement algorithms discussed for dynamic partitioning (Section 7.2), a list of the free blocks of memory must be kept. ForQ:Another placement algorithm for dynamic partitioning is referred to as worst-fit. In this case, the largest free block of memory is used for bringingQ:This diagram shows an example of memory configuration under dynamic partitioning, after a number of placement and swapping-out operations have been