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.

none of the option is correct.

step-by-step explanation:

it says to find which expression equals 9^3 sqrt 10 = ?

9^3 sqrt 10 = 729 sqrt 10.

checking option a. 5 sqrt 10 + 4 sqrt 10

5 sqrt 10 + 4 sqrt 10

= 9 sqrt 10.

checking option b. 5^3 sqrt 10 + 4^3 sqrt 10

5^3 sqrt 10 + 4^3 sqrt 10

= 125 sqrt 10 + 64 sqrt 10

= 189 sqrt 10.

checking option c. 5 sqrt 10 + 4^3 sqrt 10

5 sqrt 10 + 4^3 sqrt 10

= 5 sqrt 10 + 64 sqrt 10

= 69 sqrt 10.

checking option d. 5^3 sqrt 10 + 4 sqrt 10

5^3 sqrt 10 + 4 sqrt 10

= 125 sqrt 10 + 4 sqrt 10

= 129 sqrt 10.

hence, none of the option is correct.

part d

step-by-step explanation:

theresa talked her parents into getting sd cards for her phone and her brother’s phone. inserting an sd card into a phone gives it more storage. they both get 8-gigabyte sd cards. how many bits of storage come with each sd card? type your answer in both scientific and standard notation.

brandon has 4344 video games.  

step-by-step explanation

7373 - 2929 = 4344

pls let me know if it was correct