Question Consider a language defined over ={ab} that accepts the strings starting with a. a. Give its transition diagram using JElap. b. Write a C/C++ program that stays in an infinite loop, prompts...

Extracted text: Question Consider a language defined over ={ab} that accepts the strings starting with a. a. Give its transition diagram using JElap. b. Write a C/C++ program that stays in an infinite loop, prompts the user for a string, terminates if the string is QUIT, and otherwise implements the DFA using the scheme that allows state to state function-call and recursion. c. Give the source code and the runtime screen while testing the strings aabab. abbaaba and abbb.