Suppose we want to choose 5 letters, without replacement, from 14 distinct letters. (a) How many ways can this be done, if the order of the choices matters?
Х
(b) How many ways can this be done, if the order of the choices does not matter?

5x + 5

step-by-step explanation:

you should always add the diagrams and graphs we cannot see. this particular question is kind of borderline because we can make a graph for you.

(f + g)x = -x^2 +3x + 5 + x^2 + 2x

(f + g)x = 5x + 5

the graph of z = 5x + 5 is shown below. always use desmos when in doubt.

step-by-step explanation:

y∈r, 8> y≥0

hope i !

p.s the first bit only matters if you know what that means.

p.p.s brainliest would really