Consider an 8-bit memory architecture that uses a single level page table with 4-bit page numbers and implements demand paging and copy-on-write. Consider the following page table where the pages are...

Extracted text: Consider an 8-bit memory architecture that uses a single level page table with 4-bit page numbers and implements demand paging and copy-on-write. Consider the following page table where the pages are numbered from the bottom up. I.e., the bottom entry corresponds to page 0. Valid Access Frame 1 RW Ox3 RW Ox0 1 RW Ox1 RW RW RW RW RW RW RW 1 RW Ox7 1 RW Ox8 RW Ox2 RX Ox4 RX Ox9 RX Ox4 In the worst case, how many pages will need to be copied as a result of this process' execution? O All of them