Write a program to read from the user a string of characters, ending with $, for the FA of the language L = (a|b)*ba*a to determine whether the following words are accepted or rejected by L. For example, for the input aaaba$ the output should be YES while for the input babb$ the output should be NO. Save it as Prog1.

Here is the NFA and DFA:

2) Given the lanquage L-(alb) bua over the alputet ga, b a1 b C62 b) Comact the NA to DFA OFA 2) Given the lanquage L-(alb) bua over the alputet ga, b a1 b C62 b) Comact the NA to DFA OFA