Question 12 Complete
Mark 1.00 out of 1.00
If every Euler circuit in K_{2,4} is a path of length n, find n.
a. 8
b. The graph does not have an Euler circuit.
c. 2
Od. 6
Question 13 Complete
Mark 1.00 out of 1.00
Find a recurrence relation for the number of bit strings of length n that do not contain three consecutive Os.
a.a\_n=a\_(n-1)+a(n-2)n>=2
b. a\_n=a\_(n-1)+a\_(n-2)+a\_(n-3) n>=3
c. None of these
d. a\_n=a\_(n-1)+a\_(n-2), n>=3
