In N-version programming which is the independent generation of N, the value of N is a) greater than 1 b) less than 1 c) greater than 2 d) less than 2

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; }

Please written by computer source

#include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) {     for (int i = 0; i < n - 1; i++) {         for (int j = 0; j < n - i - 1; j++) {             if (arr[j] > arr[j + 1]) {                 int temp = arr[j];                 arr[j] = arr[j + 1];                 arr[j + 1] = temp;             }         }     } } int binarySearch(int arr[], int l, int r, int x, int& comp) {     comp++;     if (r >= l) {         int mid = l + (r - l) / 2;         if (arr[mid] == x) {             return mid;         }         if (arr[mid] > x) {             return binarySearch(arr, l, mid - 1, x, comp);         }         return binarySearch(arr, mid + 1, r, x, comp);     }     return -1; } int main() {     int Num[8192];     srand(time(NULL));     for (int i = 0; i < 8192; i++) {         Num[i] = rand() % 10001;     }         clock_t starting_time = clock();     bubbleSort(Num, 8192);     clock_t ending_time = clock();     clock_t result =…