Please provide explanation

Devise context$-$free grammars for the following languages:

L$\_(1)=\{0^($i$)1^($j$)$:$($i$)/($i$+$j$)>=(1)/(4)$ and i$,$j$>0\}^(*).($Please note the Kleene$-*$ operator.$)$

L$\_(2)=\{(0^($i$)1^($k$)2^($j$)3^($l$)$ :i$-2$j$=$l$-2$k$)$:$\}$ and $\{$:i$,$j$,$k$,$l$>=0\}$

L$\_(3)=\{(0^($i$)1^($m$)2^($k$)$ :i$,$m$,$k$>=0)$:$\}$ and $\{$:max$\{2$i$,3$k$\}>=5$m$\}$

Hint: max$\{$a$,$b$\}>=$c if and only if a$>=$c or b$>=$c$.$

L$\_(4)=\{$win$\{0,1\}^(*)$:#o$($w$)=$#$\_(1)($w$)+2\}.$

Here, #o$($w$),$#$\_(1)($w$)$ represent the number of zeros and ones in w$,$ respectively.

L$\_(5)=\{($w in $(\{0\}.\{1\}^(+))^(*)$:w$)$:$\}$ contains two runs of ones that are of different lengths