A. For the following questions, assume the following: (8 points) . 16-bit virtual addresses . 4 KiB page size . 16 KiB of physical memory with least recently used (LRU) page replacement policy Fully associative TLB with 4 entries and an LRU replacement policy i. What is the maximum number of virtual pages per process? (2 points) ii. How many bits wide is the page table base register? (2 points) For questions (ii) and (iv), assume that: . Only the code and the two arrays take up memory .The arrays are both page-aligned (starts on page boundary) .The arrays are the same size and do not overlap ALL of the code fits in a single page and this is the only process running void scalc _n_copy(int32 t *base, int32 t*copy, uint32_t num entries, int32 t scalar) for (uint32t i-0, i