Mikey has two mice that were about the same age and weight Mikey fed each of the 2 mice a different feed for a month. He measure
d how much the mice weighed every two days until the month was over Mikey’s results showed that although both mice
Which graph below best shows these results?
Which graph below best shows these results?
2 answers:
The following is the rest of the question:
------------------------------------------------------
Mikey's results showed that although both mice gained weight over the month, mouse 2 gained more weight than mouse 1.Which graph below best shows these results?
The complete figure is attached
=========================================================
Solution:
---------------
Graph (1)⇒⇒⇒ mouse 2 has constant weight and mouse 1 gained weight
Graph (3)⇒⇒⇒ mouse 2 has did not gain weight and mouse 1 gained weight
∴ Graph (1) and (3) are incorrect because both mice gained weight .
Graph (4) is incorrect because mouse 2 gained more weight than mouse 1
So, the correct answer is graph (2)
------------------------------------------------------
Mikey's results showed that although both mice gained weight over the month, mouse 2 gained more weight than mouse 1.Which graph below best shows these results?
The complete figure is attached
=========================================================
Solution:
---------------
Graph (1)⇒⇒⇒ mouse 2 has constant weight and mouse 1 gained weight
Graph (3)⇒⇒⇒ mouse 2 has did not gain weight and mouse 1 gained weight
∴ Graph (1) and (3) are incorrect because both mice gained weight .
Graph (4) is incorrect because mouse 2 gained more weight than mouse 1
So, the correct answer is graph (2)
You might be interested in
Answer:
32760 ways
Step-by-step explanation:
Given
Number of Candidates = 15
Job Positions = 4
Required:
Number of outcomes
This question represent selection; i.e. selecting candidates for job positions;
This question can be solved in any of the following two ways
Method 1.
The first candidate can be chosen from any of the 15 candidates
The second candidate can be chosen from any of the remaining 14 candidates
The third candidate can be chosen from any of the remaining 13 candidates
The fourth candidate can be chosen from any of the remaining 12 candidates
Total Possible Selection = 15 * 14 * 13 * 12
<em>Total Possible Selection = 32760 ways</em>
<em></em>
Method 2:
This can be solved using permutation method which goes thus;
Where n = 15 and r = 4
So;
becomes
<em>Hence, there are 32760 ways</em>