Agame is played where 26 tiles are in a bag. each tile has a different letter of the alphabet on it. if you draw 5 letters, what is the probability of the letters being m-u-s-i-c in order, if there is no replacement?

answer: the answer is one

step-by-step explanation:

pemdas, in this situation there is no parenthesis or exponents so you go to multiplication, 1x1=1, then division 1/1= 1 then addition 1+1=2 then subtraction 2-1=1

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)

ranks (& how to earn them):

-beginner (needs at least 0 points & 0 brainliest answers)

- hand (needs at least 100 points & 0 brainliest answers)

-ambitious   (needs at least 250 points & 0 brainliest answers)

-virtuoso (needs at least 500 points & 5 brainliest answers)

-expert   (needs at least 1,000 points & 10 brainliest answers)

-ace (needs at least 3,000 points & 15 brainliest answers)

-genius   (needs at least 15,000 points & 50 brainliest answers)

how to award brainliest:

you must wait until 2 people answer to award brainliest. i'm pretty sure that it should be next to the "" and "comments" buttons.