Answer:
There will be 90 ways to reach Greenup from Charleston.
Step-by-step explanation:
<em>Option C: 90 is correct.</em>
Let's name all the ways and try to visualize the roads.
C = Charleston
M = Mattoon
T = Toledo
G = Greenup
Task = Charleston to Greenup. How many different ways to reach?
1 1
2 2 1
C 3 M 3 T 2 G
4 4 3
5 5
6
So, Refer to this above diagram.
If we Start from C then go to 1 and then go to M and then go to 1 and then go to T and then go to 1 and then go G.
If you notice, in this single possibility we have 3 ways: C to 1 to M, M to 1 to T, T to 1 to G.
It means we will have: 5 x 6 x 3 = 90 number of ways to reach greenup from Charleston.
(-4,-4) is quadrant 3
(5,2) is quadrant 1
(-6,11) is quadrant 2
this question is incorrect because the decimal quantity functional persistent shouldnt be in a sequential farfictional order so the answer would be that satisfactory angle of theslop devided by pi and then multiplied by the persistent. hope this helped!
Multiply the square root of 3 by the square root of 2 and itself.
The 3 cancels itself out and then you get A
