Determine whether the given relation is reflexive, symmetric, transitive, or none of these. (select all that apply.) let a be the set of all strings of 0's, 1's, and 2's that have length 4 and for which the sum of the characters in the string is less than or equal to 2. define a relation r on a as follows: for every s, t is in a, s r t ⇔ the sum of the characters of s equals the sum of the characters of t.

false

step-by-step explanation:

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.