If many programs are kept in main memory, then there is almostalways another program ready to run on the CPU when a page faultoccurs. Thus, CPU utilization is kept high. If, however, we allocate alarge amount of physical memory to just a few of the programs, theneach program produces a smaller number of page faults. Thus, CPUutilization is kept high among the programs in memory. What would the working set algorithm try to accomplish, and why?(Hint: These two cases represent extremes that could lead toproblematic behavior.)

With the analysis of the case, we can infer that regarding the model or algorithm of the work set, we want to reduce page faults in each individual process, guaranteeing that the set of pages are included before executing the process.

There are things that should not change, such as the set of pages used in the process or the working set as they are called, they could only change if a program moves to a different phase of execution. In this way the most suitable and profitable approach is proposed for the use of time in the processor, by avoiding bringing oagines from the hard disk and instead of this the process is executed, because otherwise it would take a long time what was observed in decreased performance.

Regarding what was mentioned in the question, it follows that 2 extremes lead to a problematic behavior, to define the first as a page fault and the second refers to a small number of processes executed.

b. related objects

explanation:

data is stored in related objects in an access database.