Exercise $7\mathrm{.}1\mathrm{.}4$: Virtual address translation. $($i$)$ About Virtual memory uses paging and segmentation. The segment table is also paged. Non$-$resident pages are kept on a disk. $[$ B; C $]-$ A virtual address has the form $($s$1,$ s$2,$ p$,$ w $)$ where each component is $2$ bits. $-$ The page table of the paged segment table starts at address $32.-$ A dash denotes a nonexistent page. $-$ A positive number, n$,$ in a table means that the page currently resident in memory staring at address n$.-$ A negative number, $-$n$,$ in a table means that the page is not resident in memory and must be loaded from the disk. The value of n then gives the disk block containing the missing page. Ex: A $-2$ in a page table entry indicates that the page is not in main memory and can be found in disk block $2.($a$)$ Starting with the page table of the segment table at address $32,$ trace down the entire memory hierarchy and label each page as: "page p of the segment table," "page table of segment s$,"$ or "page p of segment s $".$ "where p and s are the actual page and segment numbers. Page frames that remain unmarked are free. $($b$)$ Translate virtual address $113$ into a physical address and determine the content. $($c$)$ Translate the virtual address $68$ into a physical address and determine the content. Show all changes to the memory hierarchy as a result of the translation. $($d$)$ Show all changes to the memory hierarchy as a result of deleting segment $7.$