Given six memory partitions of 300 kb(m1), 600 kb(m2), 350 kb (m3), 200 kb (m4), 750 kb(m5), and 125 kb(m6) (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size p1-115 kb, p2- 500 kb, p3- 358 kb, p4 -200 kb, and p5 - 375 kb (in order)? rank the algorithms in terms of how efficiently they use memory.

its 60

4 x 12 = 48

3 x 4 = 12

48 + 12 = 60

yeeeet

let y equal to

the total fare and x is the mile of taxi ride. so the equation is

y = 0.55x + 1.75

since susie has

$10 to spend for a taxi cab, so he can have

10 = 0.55x +

1.75

x = 15 miles of

taxi ride

so the system of

inequality is

10 < 0.55x +

1.75

x > 2

the one where 1 and 2 are directly across from each other.  

see image