blackstone7149 blackstone7149 29-02-2024 Engineering contestada Give a context-free grammar for the language L = anbmck | n, m, k ≥ 0 and n = 2m + 3k.