Problem 1.13 [8 points Describe an algorithm to solve the following problem: Given two regular expressions E1 and E2, respectively with associated languages L(E1) and L(E2) over the alphabet , construct a regular expression E such that L(E) L(E) \L( neither set difference, nor set intersection, nor set complement are operators that can be used in regular expressions.) In describing the algorithm, you can make use of algorithms that have been discussed in class, without the need of detailing the various steps of these algorithms illustrate the algorithm on the example of the regular expressions E,-1* and E2 1. Notice that Ei and E2 are sufficiently simple to allow you to calculate on them the results of the algorithms discussed in class, without the need of detailing the various steps of these algorithms TO WO E). (Notice that