Write a program in C++ that takes a NFA without epsilon moves and a string as input. The program determines whether the given string is accepted by the given NFA. Details of the problem is given below

Write a program in C++ that takes following inputs - 1. Specification of a Nondeterministic Finite Automata without epsilon moves - This input should be stored in a file and program should read it from the file. 2. finput - A string entered through keyboard The program determines whether the given string finput is accepted by the given automata. Specification of finite automata includes followings - 1. Q-Set of states in finite automata 2. E-Set of input alphabet 3. 8 - Transition function of finite automata 4. qo-Initial state in finite automata 5. F-Set of final state You may choose your own format for storing above information in the file. An example session of program execution is as given below (user input is underlined) - Enter name of the file containing automata specification: fa.txt Enter the string: abbccd STRING IS ACCEPTED Want to enter more string (y): Y Enter the string: abbbc STRING IS NOT ACCEPTED Want to enter more string (y): n