--- Check below all the correct statements. (00*+11*)* = (0+1) The regular expression O*(1+0) describes the language {0'1 : i EN}. (00"+1")* = (0*+1) The three words 2, 0, 011 all belong to the language of (01")". O (0+1)(0+1)*0* = 0(0+1)*+1(0+1) The regular expression (0-1) describes the language {0'1 : ie No}. The regular expression 1.0(0+1)*1 describes all binary words containing at least one 0 and ending with 1. The regular expression (O+1)*111(0+1). describes all binary words containing at least three 1's Dane 3 of 6