can someone help me to solve this?

2. Conadder at dink oitn a bector atze of lozd bytan, t. 000 tracks per werfare, 100 a ecterin per ceacx, 7 anifleraianed a) Ifou nany rocorda fit onto n track? 1) Now nainy bloeka ite rogulted to store the deording to the 'next block concept' j on diak, hoy many. rithders are treedeat? 3. Consiaer a dynamie fAM. that mist be given a refiesh aycle 64 timen pet trm. Fach refreoh operation requires 150 nsiz a menory. eycle requireg. 250ng. What pereentage of the memory g total operating bime mast be.given to tefreshes? 4. what is the puypore of asacpingt How thie mechaniam heliou chen os in muenory nanayannnt? 5. Consider the following set of jobs to be scheduled on a single cPU sygtem, draw a Gante chart showing [3 Marks] a) Firdt Conte Eirnt Serve Scheduling Algorithr b) Shortest Job Filrat Soheduling Algorithm 6. Ansirer the following, thou the detafla of your work. t2. Karkn] A.(In1)01105)z=(F.Ih b.{11001}=0T1n e. {21000001110100}==(2)18 d. (21003)16=( ? 110 7. What will be the I?h blnary coide for the tirat khrne 8. Differentiate betwen piegrimmed driven and inter upt: Difteremtiate betweten programand in each caste. (2. Marka) Tabler & Fornutand BPA Tabini bit posianon N - number of date disket proportional to log N Gonversiop Fable