a. Only a Hamiltonian path
One such path is
1 → 2 → 0 → 4 → 3
which satisfies the requirement that each vertex is visited exactly once.
There is no Hamiltonian circuit, however, since it is impossible for any Hamiltonian path on this graph to visit vertex 0 exactly once.
V=4πr^3V=4π(11)^3<span>
V=5575.28
22 is the diameter and the radius is half of the diameter </span>
Steps
1. Do the point slope form
Y-Y1=4(X-X1)
Y-4=4(x-2)
Y-4=4x + (-8)
2. Add 4 on both sides
Y= 4x-4
3. Your answer is
Y=4x-4
Answer:
C)
Step-by-step explanation:
Note that one of the lines is simply y=-1 for any x, so we can dismiss the only answer without y=-1. That rejected answer is A)
Now let's notice, that the other line is decreasing y when increasing x. That tells us that in the equation y = ax + b, a has to be negative. This brings us to reject option D).
What is the y of that line for x = 0? Because y = ax + b, for x = 0 we will get the value of b. This is called the intercept. The line is at y=4 for x=0, so we know that the b in the equation must be positive 4. This fits answer C, but rejects answer B). And so, we have found that C) is the only possible answer.
