a. Give an NFA recognizing the language (01 U 001 U 010)*. b. Convert this NFA to an equivalent DFA. Give only the portion of the DFA that is reachable from the start state.

Please help me in C++ I just need help with my ceasar cipher and decipher function please help

Please use easy logic with proper indentations and comments for understanding!. Coding should be in C++. I am providing an algorithm that you will need to answer this coding question. I am also providing this solved program but it's not printing each line separately as it supposed to (Output is given in the picture). The file has 3 separate sentences on 3 lines. Our program supposed to print three separate lines as exactly shown in the sample output. Please review my code and provide a correction to it. Thank you 1 2 3 #include <iostream> 4 #include <fstream>5 #include <cstdlib>6 7 using namespace std; 8 9 void status(string st,int &vowel,int &consonant, int &other)10 {11 12     //if it is vowel13     if ((st[0]=='a' || st[0] == 'e' || st[0] == 'i' || st[0] == 'o' || st[0]=='u') || (st[0]=='A' || st[0] == 'E' || st[0] == 'I' || st[0] == 'O' || st[0]=='U') )14         vowel++;  //incrementing vowels by 115     else if(isalpha(st[0]))16         consonant++;…

What are the drawbacks of using assembly language for non-specialist programming tasks? Is there ever a time when you'd recommend using assembly language?

Write in C++ please.

Q2. Construct regular expressions for the following languages. Verify your answer by generating at least one correct string. a. The language over the alphabet (a, b, c) of all three letter words that end in bc b. The language over the alphabet (a, b, c}of all words starting with any number of a's, followed by any number of b's and ending in one or two c's c. The language over the alphabet (a, b, c, d, e, f} where each string starts with a "ab", has either c or d in the middle, and ends with any number of the substring "ef". d. The language over the alphabet (a, b, c) of all words where the words start with either an a or a b followed by as many c's as we want. (the total number or a or b cannot be more that 1) (in any string ther can only be one a or one b) e. The language of only those strings over A= {0, 1} which have exactly 2 zeros