4 (20 points) For each regular language A, give an example of a string s in the language A of length at least 5. Then show that the string can be divided into s -ryz that satisfies these three conditions: 1. zy'z E A for any i20 2. lyl 0 by simply says what are strings x, y, and z. Assume that {0,1} a. A = {w | w starts with 1} b. A = {w | w ends with 0} c, A = {w | w starts with a 1 and ends with a 0} d. A = {w | w contains 01 as a substring}