Describe a θ(nlgn) algorithm that, given a set s of n integers and another integer ,determines whether or not there exist two elements in s whose sum is exactly x.

the answer will be b x² +x-1

step-by-step explanation:

answer is 8x+24

area of vanessa's patio = length × width

given, length = (3x² + 5x + 10)

width = (x² - 3x - 1)

area of vanessa's patio = (3x² + 5x + 10)(x² - 3x - 1)

= 3x²(x² - 3x - 1) + 5x(x² - 3x - 1) + 10(x² - 3x - 1)

= 3x⁴ - 9x³ - 3x² + 5x³ - 15x² - 5x + 10x² - 30x - 10

= 3x⁴ - 4x³ - 8x² - 35x - 10

hence, expression of vanessa's patio = (3x⁴ - 4x³ - 8x² - 35x - 10)

b. hannah is playing with her cousin at

i can not answer the question due to the fact that you spelled "carton" as "cartoon", a cartoon is something you watch on tv, a carton is a box that holds things. and also you've been waiting for this question for a while so why don't you get off your lazy a** and try to figure it out for yourself for once!

step-by-step explanation:

===============================================================^

look above, and leave your comments down below, and don't for get a five stars and a and brainliest xd

sorry for the stars in the middle of words its because it wouldn't let me submit. xd