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.

to find the total number of combinations, multiply the quantity of each item by each other:

2 pairs of shoes x 3 pairs of shorts = 6 different combinations.

35%

step-by-step explanation:

option (a)

step-by-step explanation:

step 1:   take 2 number whose product equal to 25..

and sum of those two number are -10

step: 2 for example here if we take 5,5 are the number,,

5*5=25

and

5+5=10

but we need -10

so if we take   -5,-5

so -5*-5=25

and -5+(-5)=-10

s0

come the equation

replace -10x by these number

like -5x -5x+25

take common

x(x-5)-5(x-5)=0

(x-5)(x-5)=0