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.
Answer:
n=0
Step-by-step explanation:
because 0 would be the only number that would make both sides equal
( i know it not the best explanation )
Answer:
and 
Step-by-step explanation:
The equation of curve is
We need to find the equation of the tangent line to the curve at the point (-3, 1).
Differentiate with respect to x.
![2[2(x^2+y^2)\frac{d}{dx}(x^2+y^2)]=25(2x-2y\frac{dy}{dx})](https://tex.z-dn.net/?f=2%5B2%28x%5E2%2By%5E2%29%5Cfrac%7Bd%7D%7Bdx%7D%28x%5E2%2By%5E2%29%5D%3D25%282x-2y%5Cfrac%7Bdy%7D%7Bdx%7D%29)
The point of tangency is (-3,1). It means the slope of tangent is 
.
Substitute x=-3 and y=1 in the above equation.
Divide both sides by 130.
If a line passes through a points 
with slope m, then the point slope form of the line is
The slope of tangent line is 
and it passes through the point (-3,1). So, the equation of tangent is
Add 1 on both sides.
Therefore, and .
Even function is symmetrical about the y axis
not sure what it means if the polynomial is positive
the zeroes are how many times it hits the x axis
it hits 4 times so 4 zeros
ASA
Angle-Side-Angle
AAS is the same but the order in different.
SAS is a no because there are no two S.
Can't determine bah! You can determine.
PLEASE BRAINLIEST
