Problem 1(10 points) Construct deterministic FSAs for each of the following languages over the alphabet a, b: 1. Lw: w contains the string aaa or the string bbb) 2. L,-(w:w contains the string aaa and the string bbb}