The number of unique combinations that can be formed by picking one object from each of k different sets of objects is equal to no(na) (m) (n)".
where the size of the first set is ny, the size of the second set is n2, and so
forth.

option c) graph of line going through 1, 4 and 3, 10

step-by-step explanation:

let y equal to margo's coin collection

let x equal to number of years

at the begining x=0, y=1 → point=(x,y)→point=(0,1)

she adds 3 coins per year, then y=1+3x

at x=1, y=1+3(1)=1+3→y=4→point=(x,y)→point=(1,4)

at x=3, y=1+3(3)=1+9→y=10→point=(x,y)→point=(3,10)

the graph of line going through (1, 4) and (3, 10), then the option c is the correct.

if you would like with a question it is easy to get an answer by including some or multi choice options

step-by-step explanation: