Q$2.$ Write a program that simulates an operating system's memory management using

segmentation. Your task is to simulate the process of translating logical addresses to

physical addresses using the concept of segmentation. Additionally, you will simulate

conditions where a segmentation fault occurs. Add your assumptions, if any, to a

ReadMe file. $[20$ pts$]$

Design:

$$ The system has three segments: Code, Heap, and Stack.

$$ Each segment has a base and a limit $($bounds$),$ which define where the segment

starts in memory and its length.

$$ Assume the system has a $64$KB physical memory, and memory is reserved as

follows:

$$ Code Segment: Starts at $32$KB$,$ size $2$KB$.$

$$ Heap Segment: Starts at $34$KB$,$ size $3$KB$.$

$$ Stack Segment: Starts at $28$KB and grows downwards, size $2$KB$.$

$$ A segmentation fault should be raised if the offset exceeds the segment's limit$.$

$$ Use the pseudocode from Chapter $16$ for the address translation.

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

Output: $16-$bit physical address in hex format or segmentation fault. solve