Recall that the symmetric difference of two sets A and B, denoted by AB, is the set (AB)(BA). Prove that if both A and B are regular languages, then AB is also a regular language. Question 2 Give the state diagram of an NFA that has exactly five states and accepts the language {ww contains the substring 1010}. Note that the alphabet is ={0,1}