Give a Finite Automaton for each of the following languages defined over the alphabet = {0,1}: (a) L={ w | w ends in 110 } (b) L={w |The symbol in the 2nd last position of w is 1. }