3. Create the Nondeterministic finite automatons for the next set. a) Obtain an NFA given the following language defined in the alphabet = {0,1}. Set of strings starting at 0. b) Obtain an NFA given the following language defined in the alphabet = {0,1}. Set of strings ending in 1. c) Obtain an NFA given the following language defined in the alphabet = {0,1}. Set of strings containing the sub-string 01. d) Obtain an NFA given the following language defined in the alphabet ={a,b,c}. Set of strings that start at the substring ac or end at the substring ab. e) Obtain an NFA given the following language defined in the alphabet ={a,b,c}. Set of strings starting at the substring ac and ending at the substring ab.