Assume that you have a program to run on a Little Man-type computer that provides virtual storage paging. Each page holds ten locations (in other words, one digit). The system can support up to one hundred pages of memory. As Figure 18E.3 shows, your program is sixty-five instructions long. The available frames in physical memory are also shown in the diagram. All blocked-in areas are already occupied by other programs that are sharing the use of the Little Man.

Figure 18E.3

a. Create a starting page table for your program. Assume that your program will start executing at its location 0.
b. Suppose a page fault occurs in your program. The OS has to decide whether to swap out one of your older pages, or one of somebody else€™s pages. Which strategy is less likely to cause thrashing? Why?

90 100 230 20 250 40 670 60 65 680 999