96 (5 pts.) Matching Regular Expression Rules) Each expression on the left is equivalent to exactly one expression on the right for all languages A and B over an alphabet (you should expect to have at least two chars). It does not matter if you regard A and B as being regular expressions instead -the rules work for nonregular languages too but they are "regular rules." Note that U and the binary operator+are the same, whereas the superscript means "one-or-more." Premise Response Drag and drop to match 1 (AB + e)- 2 A(B + AB) 8 (4+AAB')B 3 B(A AAB c (AB)A 4 A(BA) (AB). = E