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

where r the answers

step-by-step explanation:

the 8 in 8,420 is in the thousands place so it's value is 8 thousand.

the 8 in 6,870 is in the hundreds place so it's value is 8 hundred.

divide 8000 by 800 to find the answer:

8000 / 800 = 10

the 8 in 8,420 is 10 times greater than the 8 in 6,870

answer: n word

step-by-step explanation:

what type of people are in the hood?

what steals your tv in the dark and you cant see them?

asnwer is (g o h o f)(x) = 2x - 6/x + 7

step-by-step explanation:

given,

f(x) = x - 3/x

g(x) = x + 3

h(x) = 2x + 1

we need to find : (g o h o f)(x)

we can write (g o h o f)(x) = g[ h{ f(x) } ]

so first we find h{f(x)}

h{f(x)} = f(x) + 3 = (x - 3/x) + 3

h{f(x)} = x - 3/x + 3

now we find g[ h{ f(x) } ].

g[ h{ f(x) } ] = g(x - 3/x + 3)       {plug h{f(x)} = x - 3/x + 3 in g[h{f(x)}] }

g(x - 3/x + 3) = 2 (x - 3/x + 3) + 1

                    = 2x - 6/x + 6 + 1

                    = 2x - 6/x + 7

hence we get (g o h o f)(x) = 2x - 6/x + 7