Can someone please help me with this.

Let sigma = {1, #}, and L4 = {w | w = x^1#x^2# ellipsis #x^k# where k greaterthanorequalto 0, x^i elementof 1^*, and if i notequalto j then x^i notequalto x^j} In other words, Y is the set of all strings that have zero or more substrings that consists of 1s separated by #. However, the sequences of 1s cannot be of the same length. For instance, # elementof L4 and 1# elementof L4, but 1#11#1# NotElementof L4. If Y is regular, build the corresponding FA that accepts the languages. If not, demonstrate that by using the pumping lemma proof. Solution: Let Sigma = {c, d} and L5 = {c^n d^m| n > m and n, m greaterthanorequalto 0 and 1