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:
it's option A .............
Answer: 0.1 OR 1/10
Step-by-step explanation:
Think about it: There's 1/2 bag of oranges, and you wanna know what number of oranges used in the juice. Take 1/2, and divided it by 5. You get 0.1, then you should turn it into a fraction, giving you 1/10.
For this type of question it is easiest to think about it in terms of a simple multiplication. The way we can do this is by working out how many possibilities there are for each position on the program. This is as follows:
For the first act, there are 9 possible performers we can pick
For the second act, because we have already assigned a performer to the first act, there are only 8 possible performers
For the third act, because we have already assigned a performer to the first two acts, there are only 7 possible performers
This goes on and on until we reach the final act, where we have used all the performers except one.
Therefore we can say:
For the first act there are 9 possibilities
For the second act there are 8 possibilities
For the third act there are 7 possibilities
For the fourth act there are 6 possibilities and so on
If we want to write this mathematically we can just say that there are:
9 possibilities x 8 possibilites x 7 possibilities etc right down until we are at the final act where there is 1 possibility.
To write this out as an equation we just say:
9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1 = the number of different ways
In maths however, we have a much simpler way of saying this, which we call "factorial".
That whole stream of numbers up there can just be said to be "9 factorial", or if we are writing it in an equation "9!". You may find that your calculator has a button which has an "!" on it. If you put in the number of performers and then press the "!" button, it will give you the answer to your question.
Hope this helped you :)
