Give a decision tree argument showing that at least 3 such questions are necessary in worst case. In other words, prove that no correct algorithm can solve this problem by asking only 2 questions in worst case. b. Design an algorithm that will solve this problem by asking 3 such questions in worst case. Express your algorithm as a decision tree.

answer: 75°

step-by-step explanation:

∠esk is the supplement of ∠edk, so is 100°. ∠esd = 1/2·arc ed, so is 25°.

since ∠esk = ∠esd + ∠dsk

you have 100° = 25° + ∠dsk . .

fill in known values 75° = ∠dsk . . . . .

subtract 25°

step-by-step explanation:

both the histogram and the stem and leaf plot will visually show how many shoppers were of various ages within each range of data.   the histogram does not give us the specific ages of these shoppers unlike the stem and leaf plot.a histogram does not give us a true range of the data because we do not know exactly how old the shoppers were. a stem and leaf plot will give exact ages, so we can determine the exact range along with all measures of center and the others measures of center.   with the histogram, we cannot find any of these.

step-by-step explanation:

answer: can you show the options ?

step-by-step explanation:

write out the polynomial, with leading coefficient 1:

y = 1 (x+2)^1 (x-7)^1 (x-5)^2

next time, share the answer choices.   .