Suppose you are a new employee. You notice that each payment option describes a sequence and decide to use rules to help determine which option to take. Determine the iterative rule for each sequence. Show your work.
Your friend trusts your tables in Problem 1, but wonders if you wrote the iterative rules correctly. Show two calculations to convince your friend that both your rules work.

step-by-step explanation:

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation:

-2x-4

step-by-step explanation: