Calculate the number of CFG that are not regular from the following languages.

L1 = {\(ww^R\)| W {a,b}}

L2 = {\(w|w\) {a,b}, \(|w_a|=|w_b|\)}

L3 = {\(a^ib^ic^j|\)i , j > 0}

L4 = {\(a^n |\) n>0} \(\cup\) {\(b^m | \)m>0}

L5 = {\(w | w\) {(,)}*: w is a balanced string of parenthesis}

Enter numerical value using the virtual keypad. Round off where necessary.

Calculate the number of CFG that are not regular from the following languages. L1 = {\(ww^R\)| W {a,b}*} L2 = {\(w|w\) {a,b}*, \(|w_a|=|w_b|\)} L3 = {\(a^ib^ic^j|\)i , j > 0} L4 = {\(a^n |\) n>0} \(\cup\) {\(b^m | \)m>0} L5 = {\(w | w\) {(,)}*: w is a balanced string of parenthesis}