2. Let RE be the set of regular expressions over alphabet E = {0, 1}, and for r E RB, let L(r) be the language denoted byr. Consider the claim: VL E P(E"), Vri,ra € RE, (C(r1)) > 1AL\ C(r) = C(ri)) L...

1AL\ C(r) = C(ri)) L is regular Either prove this, or find L,ri and ra that provide a counter-example. "/>
Extracted text: 2. Let RE be the set of regular expressions over alphabet E = {0, 1}, and for r E RB, let L(r) be the language denoted byr. Consider the claim: VL E P(E"), Vri,ra € RE, (C(r1)) > 1AL\ C(r) = C(ri)) L is regular Either prove this, or find L,ri and ra that provide a counter-example.