Find context-free grammars for the following languages (with n 0, m 0)

(1) L = {aⁿb^m : n =/ 2m}

(2) L = {aⁿb^m : 2n m 3n}

(3) L = {w {a,b} : na(w) 6= nb(w)}

(4) L = {w {a,b} : na(v) nb(v), where v is any prefix of w}

(5) L = {w {a,b} : na(w) = 2nb(w) + 1}