) Consider a paging system with the page table stored in memory. a)lf a memory reference takes 200 nanoseconds, how long does a paged memory reference take? b)lf we add associative registers, and 80 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there.) (5 Marks] II) Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB. These partitions need to be allocated to four processes of sizes 355 KB, 215 KB, 472 KB and 493 KB in that order. Perform the allocation of processes using-First Fit, Best Fit, Worst Fit algorithm. [ 5 Marks]