Given the language L=(a | b)* ba*a over the alphabet { a, b }

Write a program to read from the user a string of characters, ending with $, for the FA of the language L 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.

w'il be NEDA slotc., and?ist s-final state ard tte aoqiing side. b) conert NEA DRA a b a. ?is te-starting state Landese, is the final