bie World   ------------       input   10   2   4 9       output   YES       */   #include   using namespace std;

1. Implement a class IntArr using dynamic memory. a. data members: capacity: maximum number of elements in the array size: current number of elements in the array array: a pointer to a dynamic array of integers b. constructors: default constructor: capacity and size are 0, array pointer is nullptr user constructor: create a dynamic array of the specified size c. overloaded operators: subscript operator: return an element or exits if illegal index d. "the big three": copy constructor: construct an IntArr object using deep copy assignment overload operator: deep copy from one object to another destructor: destroys an object without creating a memory leak e. grow function: "grow" the array to twice its capacity f. push_back function: add a new integer to the end of the array g. pop_back function: remove the last element in the array h. getSize function: return the current size of the array (not capacity) i. Use the provided main function (next page) and output example Notes a. grow…

C++ complete and create magical square #include <iostream> using namespace std; class Vec {public:Vec(){ }int size(){return this->sz;} int capacity(){return this->cap;} void reserve( int n ){// TODO:// (0) check the n should be > size, otherwise// ignore this action.if ( n > sz ){// (1) create a new int array which size is n// and get its addressint *newarr = new int[n];// (2) use for loop to copy the old array to the// new array // (3) update the variable to the new address // (4) delete old arraydelete[] oldarr; } } void push_back( int v ){// TODO: if ( sz == cap ){cap *= 2; reserve(cap);} // complete others } int at( int idx ){ } private:int *arr;int sz = 0;int cap = 0; }; int main(){Vec v;v.reserve(10);v.push_back(3);v.push_back(2);cout << v.size() << endl; // 2cout << v.capacity() << endl; // 10v.push_back(3);v.push_back(2);v.push_back(3);v.push_back(4);v.push_back(3);v.push_back(7);v.push_back(3);v.push_back(8);v.push_back(2);cout…

// MichiganCities.cpp - This program prints a message for invalid cities in Michigan.   // Input:  Interactive // Output:  Error message or nothing #include <iostream> #include <string> using namespace std; int main()  {    // Declare variables    string inCity;   // name of city to look up in array    const int NUM_CITIES = 10;    // Initialized array of cities    string citiesInMichigan[] = {"Acme", "Albion", "Detroit", "Watervliet", "Coloma", "Saginaw", "Richland", "Glenn", "Midland", "Brooklyn"};     bool foundIt = false;  // Flag variable    int x;         // Loop control variable    // Get user input    cout << "Enter name of city: ";    cin >> inCity;        // Write your loop here             // Write your test statement here to see if there is        // a match.  Set the flag to true if city is found.                              // Test to see if city was not found to determine if     // "Not a city in Michigan" message should be printed.…

#include <iostream>#include <string.h>using namespace std;int index1(char *T,char *P){int t=0,p=0,i,j,r;t = strlen(T);p = strlen(P);i=0;int max = t - p + 1;while(i<max){for(j=0;j<p;j++){if(P[j]==T[i+j]){r = i;break;}else r = -1;}i++;}return r;} int main(){ int l;char c[100];char d[100];cout<<"Enter First String\n"; cin>>c;cout<<"Enter Second String\n";cin>>d;l = index1(c,d);cout<<l; return 0;} Note: Remove Funcation

#include <stdio.h> struct Single {     int num; };   void printSingle(int f) {     int binaryNum[33];     int i = 0;     while(f>0)     {         binaryNum[i] = f % 2;         f = f/2;         i++;     }     for (int j=i-1; j>= 0; j--)     {         printf("%d",binaryNum[j]);     } }   int main() {     struct Single single;     single.num = 33;     printf("Number: %d\n",single.num);     printSingle(single.num);     return 0; }

#include <stdio.h>#include <stdlib.h> typedef struct Number_struct {    int num;} Number; void Swap(Number* numPtr1, Number* numPtr2) {    /* Your code goes here */} int main(void) {    Number* num1 = NULL;    Number* num2 = NULL;     num1 = (Number*)malloc(sizeof(Number));    num2 = (Number*)malloc(sizeof(Number));     int int1;    int int2;     scanf("%d", &int1);    scanf("%d", &int2);    Thank you so much but i forgot to put this how i would fit in into this. num1->num = int1;    num2->num = int2;     Swap(num1, num2);    printf("num1 = %d, num2 = %d\n",  num1->num, num2->num);     return 0;}

#include <stdio.h> struct Single {     int num; };   void printSingle(int f) {     int binaryNum[33];     int i = 0;     while(f>0)     {         binaryNum[i] = f % 2;         f = f/2;         i++;     }     for (int j=i-1; j>= 0; j--)     {         printf("%d",binaryNum[j]);     } }   int main() {     struct Single single;     single.num = 33;     printf("Number: %d\n",single.num);     printSingle(single.num);     return 0; }

Q1 #include <stdio.h>   int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key);   int *joinArray(int arrA[], int arrB[]) {     int j = 0;     if ((arrB[0] + arrB[4]) % 5 == 0)     {         arrB[0] = 0;         arrB[4] = 0;     }       for (int i = 0; i < 5; i++)     {         arrC[j++] = arrA[i];           if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1))         {             continue;         }         else             arrC[j++] = arrB[i];     }       for (int i = 0; i < j; i++)     {         int temp;         for (int k = i + 1; k < j; k++)         {             if (arrC[i] > arrC[k])             {                 temp = arrC[i];                 arrC[i] = arrC[k];                 arrC[k] = temp;             }         }     }     for (int i = 0; i < j; i++)     {         printf("%d ", arrC[i]);     }     return arrC; }   int bSearch(int arr[], int l, int h, int key) {     if (h >= l)     {         int mid = l + (h - l) / 2;           if…