Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of
size 200 MB, 15 MB, 185 MB, 75 MB, 175MB, and 80 MB (in order)? Indicate which—if
any—requests cannot be satisfied. Comment on how efficiently each of the algorithms
manages memory.

x+2 because it just doubles hon so the pattern can actually tell you the expression.

so for example,

if x=2 then 2+2 is 4

if x=4 then 4+4 is 8

and so on and so forth.

i really hope that this makes sense and you out in a way hon: )

answer: jesus loves you

explanation:

answer:

a

explanation:

answer:

the army does care about its soilders sir i think yout getting off on the wrong foot sir you need to respect our country were keeping the peole that want to d harm towards you out. so dont go saying we don't care cause we do