Suppose you are designing a search aggregator, which for a given query fetches search results from two different search engines and presents an intersection of the two search results. here is a simplified version of this problem: given two sorted integer arrays of lengths m and n, return a new array with elements that are present in both input arrays. the input array may contain duplicates, but there should be no duplicates in the output array. for example, if the input arrays are [17, 23, 23, 35, 43, 47, 69, 78, 80, 84, 84, 86] and [23, 35, 50], the output array should be [23, 35]. (i) describe a brute force solution. what is the worst-case tight big-o time complexity of this brute solution?

number of molecules / avogadro's number * molecule molecular = mass

explanation:

we define a gram-molecular weight as the mass of one mole of any element or compound. a mole contains avogadro's number of units (molecules) –  

6.022

x

10

23

. so, dividing the number of molecules by avogadro's number gives us the number of moles. multiplying that by the molecular weight gives us the mass. from the periodic table we find the gram-molecular weight of u to be238 and of f to be19. so,  

u

f

6

will have a gram-molecular weight of 352g.

im pretty sure its b

a. energy is absorbed in the reaction.

if in a given reaction the energy of products is greater than the energy of reactants it means that reaction is endothermic and during the reaction, the energy is absorbed by reactants. in an endothermic reaction, the products have more stored chemical energy than the reactants. and in this reaction the reactants are more stable than products before the compounds with less energy are always more stable.

i think its 100.

hope this !