operating system,please answer all questions much thanks.

2: There are 2 concurrent processes wishing to enter their Critical Sections (CSi). Using Paterson's algorithm complete table below: [8] A paging system with 512 pages of logical address space, a page size of 28 and number of frames is 1024 . Answer the following questions (in bytes or in form 2n ) and show all your work. i. What is the total size of the logical address space? [2] ii. What is the total size of the physical address space? [2] iii. What is the frame size of the physical memory? [1] iv. How many frames of the physical memory in a number of the form 2n? [1] v. How many number of entry in the page table? [1] vi. What is the number of bit for the page number in logical memory address and frame number in physical memory address? [2] vii. What is the logical address (in decimal) given a physical address of 1010000100102[2] There are 4 jobs (in order) of A(100KB),B(350KB),C(450KB) and D(220KB) need to be placed in the memory. Assume a fixed partition is used with six memory partitions of 200KB,300KB,125KB,600KB,450KB and 250KB (in order). i. Use the Next-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. Draw the memory stack and label the partition size clearly (shaded for unused). [4] ii. Does internal fragmentation occur? State the internal fragmentation total? [2]