4. Create the Nondeterministic finite automatons for the next set. a) Obtain an NFA given the following language defined in the alphabet ={a,b,c}. Set of strings that start in the substring ac or do not end in the substring ab. b) Obtain an NFA given the following language defined in the alphabet ={a,b,c}. Set of strings that start at the substring ac and do not end at the substring ab. c) Obtain an NFA given the following language defined in the alphabet ={a,b,c}. Set of strings that do not start in the substring ac or do not end in the substring ab. d) Obtain an NFA given the following language defined in the alphabet ={a,b,c}. Set of strings that do not start in the substring ac and do not end in the substring ab.