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.
For this case we must find

By definition we have to:

We have the following functions:

Now, applying the given definition, we have:

Answer:

Answer:
19° I'm not completely sure but I think this is it
The answer is 10.
4 a + 5 b when a = 4 and b = - 1.2
Given:
The given system of equations is:


To find:
The solution to this system of equations by graphing.
Solution:
We have,


The table of values for first equation is:
x y
0 1
1 -1
Plot the points (0,1) and (1,-1) on a coordinate plane and connect them a straight line.
The table of values for second equation is:
x y
0 -4
2 -3
Plot the points (0,-4) and (2,-3) on a coordinate plane and connect them a straight line.
The graphs of given equations are shown in the below figure.
From the below figure, it is clear that the lines intersect each other at point (2,-3). So, the solution of the given system of equations is (2,-3).
Therefore, the solution to this system of equations is:
x-coordinate: 2
y-coordinate: -3