B. Consider a demand paging allocation scheme. The page table is implemented in associative registers. One register search takes 20 nanoseconds. One memory access takes 250 nanoseconds. One /O (read or write) disk operation takes 30milliseconds Compute the effective access time if the following statistics are given -85% of the time the page is memory resident. -30% of the time there is no free frame in physical memory -out of all replaced pages, 75% were not modified since they were brought in the physical memory Note; give first a literal solution and only after that a numeric one. B. Consider a demand paging allocation scheme. The page table is implemented in associative registers. One register search takes 20 nanoseconds. One memory access takes 250 nanoseconds. One /O (read or write) disk operation takes 30milliseconds Compute the effective access time if the following statistics are given -85% of the time the page is memory resident. -30% of the time there is no free frame in physical memory -out of all replaced pages, 75% were not modified since they were brought in the physical memory Note; give first a literal solution and only after that a numeric one