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.

The art class is planning to paint a mural on an outside wall. this figure is a scale drawing of the wall. width: 11 in length: 28 in unit rate: 1.5 ft per in. write the ratio of the area of the drawing to the area of the actual mural. write your answer as a unit rate. show that this unit rate is equal to the square of the unit rate 1.5 ft per in

Which of the functions graphed below has a removable discontinuity?

Charlie is at an amusement park that has 18 different rides. each ride costs $1.75. the function c(r) = 1.75r represents the total amount of money that charlie will spend if he goes on r rides, but he never goes on the same one more than once. what domain and range are reasonable for the function?