Hello, please answer I will upvote thanks

3. Give a CFG for each of the following languages. You should specify the set of variables, the start symbol and the set of production rules for each grammar. (e) L = {amin ck d' | m + 21 = n +k, where m, n, k, l >0}. (f)L = {W {a,b}* | na(w) = 3n6(w), where na(w), n(w) > 0}. Note: na(w) is number of a's in the string w and no(w) is number of b's in w. (8) L = {w e {a,b,c}* | na(w) + nb(w) + 3nc(w)}