Find a context-free grammar for the following languages with n 0, m 0, k 0 .

L3 = { aⁿ b^m c^k : n + 2k = m }, = {a, b, c}