Select the correct regular expression for the following language: Set of all strings over {0,1} that end with 1 has no substring 00. * 1 point 0(1+01)* 0(0+01)* 1(0+1)* 1(1+01)* 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))*