1. For each of the following languages, prove or disprove that the language is context-free. (a) L = {w: na(w) = n(w) and the second-last letter of w is b} (b) L2 L = {a^ : n 0} (c) L3 = {anbnc2n : n 0}