(Picture attached, please help!) Operating System: How many entries should you have in the hash table?

For the scenario, draw the inverted page table (similar to the Figure 1) and show the entries in the linked list with proper values.

Assume the following: Hash table You have 2048 KB of RAM Each page size is 8 KB . You are using inverted page table in your system There are two processes A and B . Virtual address space is 4096 KB Page number starts from 0. . You are given a hashing function HO that 0 Indexed by hash on virtual page Virtual page Page frame works as follows: int H( int virtual page number) Figure 1 return virtual page number mod 256; //mod function returns the remainder A: How many entries should you have in the hash table? (5 points) B: Assume that initially none of the pages are currently loaded for process A and B Then, the following sequence of page access happens: (5 points) A access virtual page 3, A access virtual page 5, B access virtual page 4, B access virtual page 132 Assume that virtual page 3 for process A is assigned to physical page 1 virtual page 5 for process A is assigned to physical page 6 virtual page 4 for process B is assigned to physical page 4 virtual page 132 for process B is assigned to physical page 7 For the above scenario, draw the inverted page table (similar to the Figure 1) and show the entries in the linked list with proper values