Ok this is answer you be the answer an to eat and see
7/8 < 9/10
thats the answer
Hope this Helped :D
Answer: A) .1587
Step-by-step explanation:
Given : The amount of soda a dispensing machine pours into a 12-ounce can of soda follows a normal distribution with a mean of 12.30 ounces and a standard deviation of 0.20 ounce.
i.e. 
and 
Let x denotes the amount of soda in any can.
Every can that has more than 12.50 ounces of soda poured into it must go through a special cleaning process before it can be sold.
Then, the probability that a randomly selected can will need to go through the mentioned process = probability that a randomly selected can has more than 12.50 ounces of soda poured into it =
![P(x>12.50)=1-P(x\leq12.50)\\\\=1-P(\dfrac{x-\mu}{\sigma}\leq\dfrac{12.50-12.30}{0.20})\\\\=1-P(z\leq1)\ \ [\because z=\dfrac{x-\mu}{\sigma}]\\\\=1-0.8413\ \ \ [\text{By z-table}]\\\\=0.1587](https://tex.z-dn.net/?f=P%28x%3E12.50%29%3D1-P%28x%5Cleq12.50%29%5C%5C%5C%5C%3D1-P%28%5Cdfrac%7Bx-%5Cmu%7D%7B%5Csigma%7D%5Cleq%5Cdfrac%7B12.50-12.30%7D%7B0.20%7D%29%5C%5C%5C%5C%3D1-P%28z%5Cleq1%29%5C%20%5C%20%5B%5Cbecause%20z%3D%5Cdfrac%7Bx-%5Cmu%7D%7B%5Csigma%7D%5D%5C%5C%5C%5C%3D1-0.8413%5C%20%5C%20%5C%20%5B%5Ctext%7BBy%20z-table%7D%5D%5C%5C%5C%5C%3D0.1587)
Hence, the required probability= A) 0.1587
Answer:
B.
Step-by-step explanation:
The direction of the arrow has to go the same way as the one in the question, from P to R. Also, the question only has one arrow, so the answer only has one arrow.
The are 40320 ways in which the 5 indistinguishable rooks be can be placed on an 8-by-8 chess- board so that no rook can attack another and neither the first row nor the first column is empty
<h3 /><h3>What involves the
rook polynomial? </h3>
The rook polynomial as a generalization of the rooks problem
Indeed, its result is that 8 non-attacking rooks can be arranged on an 8 × 8 chessboard in r8.
Hence, 8! = 40320 ways.
Therefore, there are 40320 ways in which the 5 indistinguishable rooks be can be placed on an 8-by-8 chess- board so that no rook can attack another and neither the first row nor the first column is empty.
Read more about rook polynomial
brainly.com/question/2833285
#SPJ4
