Code in C using a linux based OS

Write a program that simulates paging$-$based memory management and address

translation using a Page Table and Translation Lookaside Buffer $($TLB$).$ The program

should demonstrate how logical addresses are translated into physical addresses using

a page table and how the TLB serves as a cache to speed up this process. Add your

assumptions, if any, to a ReadMe file.

Design:

$1.$ Implement a page table that maps virtual page numbers $($VPNs$)$ to physical

frame numbers $($PFNs$).$

$2.$ Assume a fixed page size of $4$KB and $64$KB of total memory.

$3.$ Simulate a TLB that caches recent translations. The TLB size should be small

enough that it cannot hold all the pages in the system.

$4.$ The TLB should be consulted first to check if the translation exists $($TLB hit or

miss$).$

$5.$ On a TLB miss, simulate accessing the page table to fetch the PFN and update

the TLB$.$

$6.$ Use the pseudocode from Chapter $19$ for the address translation.

Input: The user can enter a $16-$bit logical address in hex format. For example: a$56$f

Output: The physical address in hex format and a string telling if this was a TLB hit or

TLB miss.

DONT USE CHATGPT