Create a finite-state machine which accepts strings whose characters are in (a, b, c and produce output strings of ts and fs. the machine outputs a t once the character pair ab (the characters must be adjacent) is encountered in the string. before this occurrence, it should output fs. indicate the the starting state, and label the states and transitions. give a diagram, not a state table