5. TLB (4 pts - Correctness) The Mars Perseverance Rover has 256MB of main memory (and a very slow PowerPC processor that is radiation hardened). Assume it has 64KB pages. a. If we have a fully associative TLB with 2048 entries, how much physical memory could be mapped at any given time? b. Luigi wants you to implement a TLB replacement algorithm. Assume the TLB is fully associative. Describe whether each of these is practical, and if so, about how many bits would be required in each entry to implement them LRU using counters Not most recently used. 5. TLB (4 pts - Correctness) The Mars Perseverance Rover has 256MB of main memory (and a very slow PowerPC processor that is radiation hardened). Assume it has 64KB pages. a. If we have a fully associative TLB with 2048 entries, how much physical memory could be mapped at any given time? b. Luigi wants you to implement a TLB replacement algorithm. Assume the TLB is fully associative. Describe whether each of these is practical, and if so, about how many bits would be required in each entry to implement them LRU using counters Not most recently used