Answer: 0.4512
Step-by-step explanation:
A bit string is sequence of bits (it only contains 0 and 1).
We assume that the 0 and 1 area equally likely to any place.
i.e. P(0)= P(1)= 
The length of bits : n = 10
Let X = Number of getting ones.
Then , 
Binomial distribution formula :
, where p= probability of getting success in each event and q= probability of getting failure in each event.
Here , 
Then ,The probability that a bit string of length 10 contains exactly 4 or 5 ones.






Hence, the probability that a bit string of length 10 contains exactly 4 or 5 ones is 0.4512.
1. "the graph has the same zeros" : so let a be the "triple" root of the cubic polynomial function.
2. So f(x)=

3. Don't forget that the expression might have a coefficient b as well, and still maintain the conditions:

4. Now, f(0)=-5 so




5. the function is

where a can be any real number except 0
Answer:
Shift 2 unit left
Flip the graph about y-axis
Stretch horizontally by factor 2
Shift vertically up by 2 units
Step-by-step explanation:
Given:
Parent function: 
Transformation function: 
Take -2 common from transform function f(x)
![f(x)=\log[-2(x+2)]+2](https://tex.z-dn.net/?f=f%28x%29%3D%5Clog%5B-2%28x%2B2%29%5D%2B2)
Now we see the step-by-step translation

Shift 2 unit left ( x → x+2 )

Flip the graph about y-axis ( (x+2) → - (x+2) )
![f(x)=\log[-(x+2)]](https://tex.z-dn.net/?f=f%28x%29%3D%5Clog%5B-%28x%2B2%29%5D)
Stretch horizontally by factor 2 [ -x(x+2) → -2(x+2) ]
![f(x)=\log[-2(x+2)]](https://tex.z-dn.net/?f=f%28x%29%3D%5Clog%5B-2%28x%2B2%29%5D)
Shift vertically up by 2 units [ f(x) → f(x) + 2 ]
![f(x)=\log[-2(x+2)]+2](https://tex.z-dn.net/?f=f%28x%29%3D%5Clog%5B-2%28x%2B2%29%5D%2B2)
Simplify the function:

Hence, Using four step of transformation to get new function 
Answer:
Austin is correct.
Step-by-step explanation:
19.5 has a tens, ones, and tenths place. 8.21 has a ones, tenths, and hundredths place.