For each of the given alphabets, draw a FSM diagram that accepts (ends up at an accepting state) the following language descriptions: a) Let sigma = {a, b, c} be the alphabet: The language of all strings with an even total number of a's and an even total number of b's. Both must be even. The number of c's can be anything. Examples: Your machine should accept (end up at an accepting state): abcabc, acca, abbcbba, ccccc, but reject: abc, cccaccc, bbabb. b) Let sigma be the English alphabet {a, b, c, d, ..., z}: The language that accepts the only the string 'piano', 'pianist', or 'patio'. In this question, we are not looking for substrings. In this you may use the complement notation (for example a means any input except for 'a') c) Let sigma = {0, 1} be the alphabet: The language in which every odd position of the string is 1. For example, your machine should accept: 1010111111 (1's found in even positions are ok:) d) Let sigma = {0, 1} be the alphabet: The language that accepts the language that the number of 0's mod 3 is equal to the number of 1's mod 3. For example, the following string 0010010100110 will be accepted as there are five 1's and eight 0's and 5 mod 3 = = 8 mod 3. e) Let sigma be the English alphabet {a, b, c, d, ..., z}: The language that ends with the string 'bob'. For example, 'chanbob', or 'abcbob' should be accepted but not 'bobbychan