Find NFA's for the following languages:

L1 ={ b k (ca)n b m : n, m ,k 0 } on = { a,b,c }. with transitions and convert it to DFA.

L2 = { w {a,b,c}* : if w contains b then n b(w) is even and neither a nor c appears between b's }

L3 = { w {a,b,c,d}* : the symbol in which w ends appears only once}.

L4 = { w {0,1}* : |w| is odd, w contains 00 but not 000 }