Q-1: Paging is a memory-management scheme that permits the physical address space of a process to be noncontiguous. However, paging avoids external fragmentation and the need for compaction. It also solves the considerable problem of fitting memory chunks of varying sizes onto the backing store Because of its advantages over earlier methods, paging in its various forms is used in most operating systems, from those for mainframes through those for smartphones. Using paging technique, convert the following logical addresses to the corresponding physical addresses in the memory. You have to draw page table and physical address space for each process given in the problem. Available frames and their base addresses are also given as follows. You must also show each logical address of each process in Binary including their page no and offset no ssume that the page size/frame size is 64 bytes. You can use same frame no and their base addresses for both the processes Process: Frame No.Base Address 14 16 19 Frame No Base Address 7AB4 2A74 7A74 5A74 SAB4 5A34 Process No Process Size 1024 2A34 2AB4 3A34 3AB4 3A74 4A34 4A74 4AB4 1A34 1A74 1AB4 7A74 37 15 23 2 Logical Addresses for process P1 400, 450, 500, 600, 650, 900 25 38 27 47 Logical Addresses for process P2 125, 150, 175, 180, 210, 225 34 37 38 45 Assume that all the available frames are in the Queue as in the same order they are given. For example, page 0 of the process P1 will be assigned to frame#14, page 1 of process P1 will be assigned to frame#16 and so [Note: Rather than showing the physical address space in one column, you can show the physical address space in multiple columns next to each other