Write the NFA for the following languages The set of string over the alphabet {a,b,c} containing at least one a and at least one b The set of strings of 0s and 1s whose tenth symbol from the right is 1 The set of strings of 0s and 1s with at most one pair of consecutive 1s

And derive the corresponding grammars