Hey i need solving these and not just the answer i really would like to know how

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.

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol