Give context-free grammars and prove/disprove if each language is regular for the following languages,

where n, m >= 0.

L₁ = {aⁿb^m | n = m + 1}

L₂ = {aⁿb^m | 2n ? m ? 3n}