Given six memory partitions of 300 kb, 600 kb, 350 kb, 200 kb, 750 kb, and 125 kb (in order, how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 kb, 500 kb, 358 kb, 200 kb, and 375 kb (in order?

Step-by-step explanation:

first fit:

115 -> 300

500-> 600

358 -> 750

200 -> 350

375 -> not able to allocate  

Best fit:

115 -> 125

500 -> 600

358 -> 750

200 -> 200

375 -> not able to allocate

worst fit:

115 -> 750

500 -> 600

358 -> not able to allocate

200 -> 350

375 -> not able to allocate

answer for #1 is c

answer for #2 is d

can i get brainliest

the data of the detroit pistons in numerical order from least to greatest is 0.30, 0.37, 0.55, 0.62, 0.69, 0.72, 0.73, 0.75, 0.77, 0.78, 0.80, 0.81, 0.81, 0.83, 0.84, 0.89

the data of the miami heat in numerical order from least to greatest is 0.50, 0.50, 0.56, 0.57, 0.67, 0.72, 0.72, 0.72, 0.75, 0.75, 0.76, 0.81, 0.82, 0.90, 1.00, 1.00

the detroit pistons median : 1.52

the miami heat median: 1.47

the iqr of this data is 0.05