In multiprogramming, a few schemes $($techniques$)$ can be applied when loading $/$ executing programs. Consider the description below, and then choose the scheme that is most accurately described:

A$)$ The program is divided into segments that match the programmer$$s view;

B$)$ These segments are loaded into memory, executed and then replaced by another module from the same or a different program;

C$)$ Segments in memory are of equal size.

Select one:

a$.$

Demand segmentation

b$.$

Paging

c$.$

Demand paging and segmentation

d$.$

Demand paging