Suppose we want to choose the 3 colors, without replacement, from the 4 colors red, blue, green, and purple. How many ways can this be done, if the order of the choices matters? How many ways can this be done, if the order of the choices does not matter?

c

step-by-step explanation:

the smallest possible measurement of the width is 14 feet

step-by-step explanation:

let's assume length of parallelogram is 'l'

width of parallelogram is 'w'

the perimeter of a parallelogram must be no less than 40 feet

so, we get

we are given

length of parallelogram is 6 feet

so,

l=6

we can plug it

now, we can solve for w

subtract both sides by 12

divide both sides by 2

and we get

so,

the smallest possible measurement of the width is 14 feet

the answer on ed. is:

c. "the graph of f(x) has exactly two x-intercepts."

hope i could someone! : )