"suppose we are comparing the implementations of algorithm a and algorithm b on the same machine. for inputs of size n, algorithm a runs in 2n steps, and algorithm b runs in 5√n steps. for which values of n does algorithm a beat algorithm b? "

answer: standard form is ax^2 + bx + c = 0

step-by-step explanation:

standard form is ax^2 + bx + c = 0

(2x + 1)(x - 2) = 0

distribute to get into standard form

2x^2 - 4x + x - 2 = 0

2x^2 - 3x - 2 = 0

a = 2, b= -3, c = -2

a is your answer

could you provide figure.

the correct answer option is (2x-3)(2x+3).

step-by-step explanation:

we are given the following expression and we are to factorize it:

we are to find such factors that when multiplied they give a result of 36 (9 x 4 = 36) and when added they give a result of 0.

the two such factors of 36 are negative six and postive six.

factorizing the given expression to get:

therefore, the correct factorization of is (2x-3)(2x+3).