Give an NFA with at most 8 states for the language L1 = {x|x is a binary string such that each run of 0s in x is divisible by 3 or 4 (or both).} A run of 0s is a substring consisting of only 0s which is not itself adjacent to another 0. For example, the string 10000000001110000 has two runs of 0s of size 9 and 4 respectively, and so is a member of L1. On the other hand, 00000010 is not in L1, since it contains a run of 0s of size 1, which is not divisible by 3 or 4.