the empty memory partiton ar listed

Q3) The empty memory partitions are listed as 100K, 500K, 200K, 450K, 600K, 350K ve 480K in order at t=0. How will the below FinalExam-Fit Algorithm put these ordered processes into the memory, if possible? Half-Worst-Fit puts the half of the process using Worst-Fit, and appends the remaining half to the list. Half-Best-Fit puts the half of the process using Best-Fit, and appends the remaining half to the list. FinalExam-Fit Algorithm: Process Memory Request If Memory Request