The language having even number of a's and even number of b's defined over S = {a, b} is called ___ code example
Example: 1. Write regular expression to describe a languages consist of strings made of even numbers a and b. CO1 K3
((a+b)(a+b))*
((a+b)(a+b))*