**********##}#{{{]][[]. Consider an alternative type of NFA, referred to as an AND-NFA that accepts if all

branches lead to accepting states. Refer to the usual NFA (which accepts if at least

one branch leads to an accepting state) as an OR-NFA. Show that if L is a language

accepted by an OR-NFA, then there exists an AND-NFA that accepts L.