Find the distance between points P(8, 2) and Q(3, 8) to the nearest tenth. * o 11
o 7.8
o 61
o 14.9

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

answer: list the statements and i will follow up!

step-by-step explanation:

shell's the art director at her local community center. she paid $10 and for each child that attends she earns $4.

for each child she ears $4 that is the slope m = 4

she paid $10, that is the initial amount paid. so 10 is the y intercept b

m =4   and b = 10

y intercept is 10 so the point is (0,10)

we start graph from y intercept (0,10)

slope = 4 . we know slope = rise / run

slope = 4   or 4/1   are same

rise = 4   and run = 1

for rise we move 4 units up and for run we move 1 unit to the right

the graph is attached below

x axis is the number of child she attends

y axis is the amount   she earns