Operating system class. I really need help with this assignment. Thank you very much

Progsnning Assigmes the spaces closest to your lending desk are at the top odf the list, and the areas farthest away are at the boroom. Which oprios is best It depends on what you want to opeimue: space or speed putitioning swheme, and Y for the dynunic partitioning scheme Ausane a starting address of Z, asd ininal job size and partition sies with the Sallowing fornat: N Partitions of Job Size Job 1 laitial dynamic partiticns for the dynanic memory alocation achene Partition 1 Calolate the anount of frapmestation uning the sed and dynamic memory allocation uhemes uing Fies-Fit. Bes-Fit, NEXT Yeur eogpanm shouild shew the Sollowing sep 2. For the fixed allocation xheme, areat eadshoct similar to table 2.1 a page 33 showing t lf the liss are organiaed by si, you'ee optimiaing your shelf space as books arive, you'll be able to put chem in the spaces that fit chem best. This isa best fit cheme. Calloulate the aining t total tragmentation and show apahots of the semary ater complerion of the job the following format for a paperback is retursed, you'll place it on a shelf with the other paperhacks or at leas with other small books. Smilarly, oversized books will he shelved with other larg whese the book r lists make it easy no find the smallest available empty spuce can fit. The dsadvantage of this sysem is that yoe'ee wasting time lo pace. Your other cusnomers have to wait foe you to put each book away, so you wos be able to process au maay custorsers as you could with the other kind of list leaves In the second cane, a lis organized by sheld location, you're optimising the time it takes you to put bucks back ono the shelves by uing a intft whenc. This mtm ames the size of the book that you'ee trying to pur away, Ii the same paperback book arrives, you can quickly find it an empty space. In lact, any nearby empty space will sufice if it's lange enough, and if ie's close so youe desk. In this case, you are opemining the time it takes you to shelive Rrpest seI through 5 for the mosted algoritnm that your tean has worked on and Progsnning Assigmes the spaces closest to your lending desk are at the top odf the list, and the areas farthest away are at the boroom. Which oprios is best It depends on what you want to opeimue: space or speed putitioning swheme, and Y for the dynunic partitioning scheme Ausane a starting address of Z, asd ininal job size and partition sies with the Sallowing fornat: N Partitions of Job Size Job 1 laitial dynamic partiticns for the dynanic memory alocation achene Partition 1 Calolate the anount of frapmestation uning the sed and dynamic memory allocation uhemes uing Fies-Fit. Bes-Fit, NEXT Yeur eogpanm shouild shew the Sollowing sep 2. For the fixed allocation xheme, areat eadshoct similar to table 2.1 a page 33 showing t lf the liss are organiaed by si, you'ee optimiaing your shelf space as books arive, you'll be able to put chem in the spaces that fit chem best. This isa best fit cheme. Calloulate the aining t total tragmentation and show apahots of the semary ater complerion of the job the following format for a paperback is retursed, you'll place it on a shelf with the other paperhacks or at leas with other small books. Smilarly, oversized books will he shelved with other larg whese the book r lists make it easy no find the smallest available empty spuce can fit. The dsadvantage of this sysem is that yoe'ee wasting time lo pace. Your other cusnomers have to wait foe you to put each book away, so you wos be able to process au maay custorsers as you could with the other kind of list leaves In the second cane, a lis organized by sheld location, you're optimising the time it takes you to put bucks back ono the shelves by uing a intft whenc. This mtm ames the size of the book that you'ee trying to pur away, Ii the same paperback book arrives, you can quickly find it an empty space. In lact, any nearby empty space will sufice if it's lange enough, and if ie's close so youe desk. In this case, you are opemining the time it takes you to shelive Rrpest seI through 5 for the mosted algoritnm that your tean has worked on and