Use a tree diagram to find the number of bit strings of
length four with no three consecutive 0s.