burn8828 burn8828 15-05-2024 Computers and Technology contestada Construct npda’s that accept the following regular languages: (a) L1 = L(aaa∗bab). (b) L2 = L(aab∗aba∗). (c) The union of L1 and L2. (d) L1 − L2. (e) The intersection of L1 and L2