Maximum score 20 (5 each part) Construct pda's that accept the following regular languages. LI = L (aaa*bab). L2 = L (aab*aba). Union of LI and L2. Intersection of LI and L2. 2 Maximum score 45 (15 each part) Construct PDA for the following languages L = {w: n_a (w) + n_b (w) = n_c(w)}. L = {w: 2 n_a (w) lessthanorequalto n_b (w) lessthanorequalto 3 n_a (w)} L = {w: n_a (w)