Suppose 1000 people enter a chess tournament. use a rooted tree model of the tournament to determine how many games must be played to determine a champion, if a player is eliminated after one loss and games are played until only one entrant has not lost.

amount of oatypop that contains the prize = 40%

amount   of oatypop which doesn't contain the prize = (100-40)=60%

probability that hannah will win a prize

    = s +f s +f f s+ff   f s+ff f f s+ infinity.where f= failure,s= success

=   or 60%

probability that hannah only has to buy 3 or less boxes before getting a prize= (s) and ( f s) and (ff s) and (f f f s)

        = = 87.04 %  

step-by-step explanation:

squares, rhombus, rectangles

$6.42

step-by-step explanation: