Q3. a. Design an NFA for a Language that accepts L= sset of all strings over {0,1} in which the last second symbol is always ' 1 ' }, and ={0,1} b. Convert it to its equivalent DFA using the subset construction algorithm and show all your steps. Q4. a. Design an NFA for a Language that accepts L={ Set of all Strings over {0,1) that ends with ' 1 ' }, and ={0,1} b. convert it to its equivalent DFA using the subset construction algorithm and show all your steps. Q5. Find the equivalent DFA for NFA given by M={{A,B,C},{a,b},,A,{C}} where is given by: Remember M={Q,,,q0,F}