Please be very descriptive with the answers and steps to get there for I am trying to learn from this and not simply just copy answers. Thank you!

2. Reading: Address Translation. Read Chapters 15-17 of the OSTEP text and answer the following questions by editing hw6.txt a. Suppose we have a simple non-segmented virtual address space, where virtual addresses are 5 bits long. How big is the virtual address space? In other words, how many elements can be addressed? b. Suppose we have a simple non-segmented virtual address space of 16K bytes. How many bits in a virtual address (assuming each byte is addressable)? c. Suppose we have a segmented virtual address space, with 2 segments. If a virtual address uses 1 bit for the segment, and 7 bits for the offset, how big is the virtual address space? (As in problem (a) above, please give your answer as a integer without units.) d. True or false: Segments must be placed next to each other in physical memory e. True or false: The maximum number of segments when using segmented virtual memory is 3. t. True or false: As a programmer, it is helpful to know the order of the code, heap, and stack segments in physical memory g. True or false: Segmentation heips in the problem of sharing code between processes h. True or false: The address space of each segment must be the same size Suppose we are using segmentation with base-and-bounds address translation. Suppose, like in Chapter 16 of OSTEP, that we have segments "Code", eap", and "Stack, where the base and bounds of each segment are as follows: Segment Code Heap Stack Base Bound 4096 2048 2048 1000 16000 8000 For eah of the olowing itual addresses, give the physical address (assume addresses 'grow positiver in each segment), or that a segmentation fault has occurred I. (Code, 153) i (Heap, 3327) k. (Code, 6211) I. (Stack, 32)