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.
C+3c is 4c and -4+9 is 5 so your answer is 4c+5
Answer:
0.8390996312 or .84
Step-by-step explanation:
Their is not a lot of information but I think it is 12*24=288
a) 
because it is equal to the area of the shaded region between X=4 and X=6, and the probability that X falls within some interval is given by the area under the PDF.
b) 
because the shaded region is a rectangle of height 1/5 (by virtue of X following a uniform distribution over the interval [2, 7], which has length 5).
