A Majority-NFA is defined as a 5-tuple M = (Q,4,8,90,F) exactly as an NFA. However, the acceptance is defined differently. An NFA accepts a string w if there is an accept state in which the machine can be after reading the input w. A Majority-NFA accepts a string w if a majority of the states in which the machine can be after reading the input w are accept states. (Note that majority means strictly more than half.) (a) Show that every regular language is recognized by a Majority-NFA. One sentence is sufficient. (b) Show that every Majority-NFA recognizes a regular language. Just consider the proof that every NFA recognizes a regular language, and point out what you would do differently