Assume the followings: - You have 1GB of RAM - Each page size is 4MB - You are using inverted page table in your system - There are two processes A and B. - Virtual address space is 8GB. - Page number starts from 0. - You are given a hashing function H( that works as follows: int H ( int virtual_page_number) \{ 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 5 A access virtual page 50 B access virtual page 261 B access virtual page 306 Assume that - virtual page 5 for process A is assigned to physical page 2 - virtual page 50 for process A is assigned to physical page 6 - virtual page 261 for process B is assigned to physical page 3 - virtual page 306 for process B is assigned to physical page 9 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