Construct a DFSA to accept each of the following languages 1 x in a,b*x does not have ababa as a substring) 2. The set of all strings of lowercase letters that begin and end in a. 3. x in 0,1*x begins or ends with 00 or 11) 4. {x in 10,1)* | each 0 in x is immediately proceeded and immediately followed by a 13. If x does not contain a 0, then it satisfies the condition 5. xe 10,13*|x corresponds to the binary encoding of a positive integer that is divisible by 73. Leading zeros are allowed