Let s be a perhaps multi-set of n integers. give an algorithm to determine whether s has k identical integers. your algorithm should terminate in o(n) expected time, regardless of k. for example, suppose that s = {75, 123, 65, 75, 9, 9, 32, 9, 93}. then the answer is yes if k ≤ 3, but no if k ≥ 4. (using words or pseudo code)

The type of program is the hierarchical grid

Hdi4nfnfuhdjdurjfjc7fjrnckf snuck fhfjfkfmfjfk4jrhr

Hypothesis: volumes of both figures are equal.the volume of  figure 1 is: .the volume of figure 2 is: .since , you can conclude that and . so, .volumes of figures are equal only when an angle in the basis is right (then figures will be the same), in another cases volume of figure 1 is less than volume of figure 2.the hypothesis was not correct in all cases.