20) Solve the problem. Suppose that 12 unique names are put into a hat and drawn at random without replacement. How many different ways can you draw all of the names from the hat? Remember that
"without replacement" means that the names are not returned to the hat after they are chosen. Write your
answer in factorial notation.
SHOW WORK: None to be shown
A) 12!
B) 11!
C) 10!
D) 12! - 1

the answer would be A) 12 because there are only twelve names

step-by-step explanation:

the first 5 right here the next 5 i will upload as separate question

answer: c, the green line

step-by-step explanation:

there is no black line, eliminate b.

simple interest implies periodic payments, but the red line shows no payments, eliminate d.

simple interest has equal payments. if paid say every day, the graph is about a straight line (actually a stairstep).

the yellow line is not straight, eliminate a.

check: the green line is straight, answer is c.

simple interest with positive interest rate gives a straight line sloping up to the right. green line:

g(t) = $100 + ($200-$100) ÷ (20 years) × (t years)

= $100 + (4%/year) × ($100)(t years)

incidentally, the yellow line curving upward represents continuously compounded interest

y = $100 × 2^(t years / (14 assuming the yellow line hits $200 at 14 years. 2^0 is 1, so y(0) = $100; 2^(14/14) is 2, so y(14) = $200.