3. How many entries in the page table? 4. Do we need a dirty bit? A valid bit? 5. How many bits in the page offset? In the tag for the real address? 6. Assume 1 (8 byte) word for each page table entry, how many bytes does the page table need? 7. If the page table is too big, we can use hierarchical or split page tables to allow parts of the page table to sit on disk or only be allocated when needed. These strategies add complexity and delay page lookup. Would you consider such strategies in this machine