Based on the table, which best predicts the end behavior of the graph of f(x)?
Х
-5
-4
-3
-2
-1
0
1
f(x)
-6
-2
0
4
4
0
-2
-6
-10
O As x, f(x), and as x _cf(x) ..
O As x, f(x) , and as X - _-, f(x) -_-
O As x, f(x) ---, and as X - _-, f(x) -
O As x, f(x) ---, and as x—_-, f(x)
WN

1696 hundred thousand

step-by-step explanation:

so what is the problem what are they asking you to solve

step-by-step explanation:

so what is the problem what are they asking you to solve

85.560%

step-by-step explanation:

conditional probability is defined as:

p(a|b) = p(a∩b) / p(b)

in other words, the probability that a occurs, given that b has occurred = the probability that both a and b occur / the probability that b occurs.

in this example:

p(turns 64 | turns 44) = p(turns 64 & turns 44) / p(turns 44).

if someone turns 64, they must have already turned 44, so:

p(turns 64 | turns 44) = p(turns 64) / p(turns 44)

on page 42, we see that of the original 100,000, 94944 turn 44, and 81234 turn 64.   therefore:

p(turns 64 | turns 44) = 81234 / 94944

p(turns 64 | turns 44) = 0.85560