Consider a language defined over ∑={a,b} that accepts the strings starting and ending in same letters. Give its RE and the transition diagram using JFlap. Write a C/C++ program that stays in an...

Consider a language defined over ∑={a,b} that accepts the strings starting and ending in same letters. Give its RE and the transition diagram using JFlap. Write a C/C++ program that stays in an infinite loop, prompts the user for a string, terminates if the string is QUIT, otherwise implements the DFA using any of the four schemes discussed in the class. The program should also display the state it enters. Give the source code and the runtime screen while testing the strings aabab, abbaaba and abbb