Consider the language ( L = ab*ab, ba, baa ) which is recognized by the DFA using your algorithm from part i above, create an NFA for the language ( shift(L) ).
a) An NFA where both ( a ) and ( b ) are shifted right by one position
b) An NFA where both ( a ) and ( b ) are shifted left by one position
c) An NFA where ( a ) is shifted left by one position and ( b ) is shifted right by one position
d) An NFA where ( a ) is shifted right by one position and ( b ) is shifted left by one position
