Define a null-free regex to one that does not contain the "empty set" symbol. Given a regex R (assume that it contains the null-set symbol) such that L(R) is not empty, (a) construct an algorithm to return an equivalent regex R' that is null-free. (b) Prove that L(R') = L(R).