Take $=\{$a$,$ b$\},$ and let na

$($w$)$ and nb

$($w$)$ denote the number of a$$s and b$$s in the string w find grammars for the languages below. Assume $=\{$a$,$ b$\}$ L $=\{$w : na

$($w$)=$ nb

$($w$)+1\}$