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.

Construct a regular expression for plate number in Saudi Arabia, e.g. RAB4377, JAK3233 State which language is False for the following regular expression (a+ | b) c (d*) = {abc, aac, aaacdd, acdd, abcd} (a* | b*) | d(e | f)* = {, aa, baa, de, def, deff, bb } (a | b)* de = {, ababde, aba, de, bbde}