popemichael6044 popemichael6044 10-01-2024 Engineering contestada Give a regular expression representing the language of all strings with an even number of 1's or an odd number of 0's, such as 1010 or 10. A) (01) B) (01)² C) (0+11*)* D) (0+1)²
