Let the "tree shortcut algorithm" be the factor-2 approximation algorithm (using mst) for tsp instances satisfying triangle inequality. show by an example that if we don’t assume the triangle inequality, then the tour found by the tree shortcut algorithm can be longer than 1000 times the optimal tour

the barter

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)

ιт ιѕ (9χ^5+10)(81χ^10-90χ^5+100)

step-by-step explanation:

нσρє ι ¢συℓ∂ нєℓρ уσυ συт тσ∂α