Construct npda’s that accept the following regular languages:
AL1 = L(aaa∗bab).
BL2 = L(aab∗aba∗).
CThe union of L1 and L2.
DL1 − L2.
EThe intersection of L1 and L2
AL1 = L(aaa∗bab).
BL2 = L(aab∗aba∗).
CThe union of L1 and L2.
DL1 − L2.
EThe intersection of L1 and L2