Suppose that you have two different algorithms for solving a problem. to solve a problem of size n, the first algorithm uses exactly n(log(n)) operations and the second algorithm uses exactly n3=2 operations. as n grows, which algorithm uses fewer operations? justify your answer using definitional proof.

ii6tyhj7 juj3yyj333ju jmyhthhtk7h jg hajj jiijh

delaney would like to make a 5lb nut mixture that is 60% peanuts and 40% almonds.

she has several pounds of peanuts and several pounds of a mixture that is 20% peanuts and 80% almonds.

let 'p' represent the number of pounds of peanuts needed to make the new mixture, and  

let 'm' represent the number of pounds of the 80% almond-20% peanut mixture.

:

p + m = 5

therefore

m = (5-p)

write an equation based on the percent of peanuts

1p + .2m = .6(5)

replace m with (5-p)

p + .2(5-p) = .6(5)

p + 1 - .2p = 3

p - .2p = 3 - 1

.8p = 2

p = 2/.8

p = 2.5 lbs of peanuts required

then

5 - 2.5 = 2.5 lbs of the peanut/almond mixture required

:

a) what is the system that models this situation?

p + m = 5

1p + .2m = .6(5)