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?

1. for the first question, we must find the mass of the anhydrous salt, mgso₄. the molar mass for mgso₄·7h₂o is 246.47 g/mol, while that of mgso₄ is 120.37 g/mol.7.834 g mgso₄·7h₂o * 1 mol mgso₄·7h₂o/246.47 g * 1 mol mgso₄/1 mol mgso₄·7h₂o * 20.37 g mgso₄/mol = 0.647 g mgso₄

2. mass of water = mass of sample - mass of anhydrous salemass of water = 7.834 - 0.647 = 7.19 gpercent water in hydrate = 7.19/7.834 * 100 = 91.74%

answer : third trial had the contaminated sample and the correct value for dhrxn should be 1000 kj/mol

explanation :

let us write down the given equations

equation 1 :

equation 2 :

equation 3 :

let us use hess's law to find out which 2 equations can be added to get the third equation.

let us reverse equation 2 and multiply it by 2. the new equation that we get is,

equation 4 :

let us add equation 1 & 4

the above equation is similar to equation 3 but has different value for dhrxn.

therefore third trial had the contaminated sample and the correct value for dhrxn should be 1000 kj/mol