Create a NFA state machine for the following language: L= { w ∈ {0,1}* | w contains odd number of 0’s or even number of 1’s.} using only  5 states

Please write down the regular expression for the language that can be accepted by the following automata (note here digit could be any digit between 0-9):

Convert the following into Pep/9 Assembler: #include using namespace std; int square(int n){     int i;     int sq;     sq = 0;     for (i = 0; i < n; i++){         sq = sq + n;     }     return sq; } int main (){     int num;     cout << "Enter a number: ";     cin >> num;     cout << num << " squared = "          << square(num)          << endl;     return 0; }

Convert the following into Pep/9 Assembler: #include <iostream>using namespace std;int square(int n){    int i;    int sq;    sq = 0;    for (i = 0; i < n; i++){        sq = sq + n;     }    return sq;}int main (){    int num;    cout << "Enter a number: ";     cin >> num;    cout << num << " squared = "          << square(num)          << endl;    return 0;} Submit: Source file along with screen captures showing the program running in the Pep simulator.