4g. the output of the following C++ code? #include using namespace std; template class XYZ { public: void putPri(); static T ipub; private: static T ipri; }; template void XYZ::putPri() { cout << ipri++ << endl; } template T XYZ::ipub = 1; template T XYZ::ipri = 1.2; int main() { XYZ a; XYZ b; a.putPri(); cout << a.ipub << endl; b.putPri(); }

#include <iostream> using namespace std; class A { private: int x; public: A(int _x) { x = _x; } int get() { return x; } }; class B { static A a; public: static int get() { return a.get(); } }; int main(void) { B b; cout << b.get(); return 0; }   Excecute and provide the screenshot.

HELP ME CODE COMPLEX.CC IN istream& operator>>(istream &lhs,Complex& rhs)PLEASE complex.cc #include <iostream>#include "complex.h"using namespace std; //Class definition file for Complex //YOU: Fill in all of these functions//There are stubs (fake functions) in there now so that it will compile//The stubs should be removed and replaced with your own c Dr // defaultComplex::Complex() {real = 0;imagine = 0;} Complex::Complex(int new_real, Imaginary new_imagine) {real = new_real;imagine= new_imagine;  }// + operator overloadComplex Complex::operator+(const Complex &rhs) const {Complex num;num.real = real + rhs.real;num.imagine = imagine + rhs.imagine;return num;}// - operator overloadComplex Complex::operator-(const Complex &rhs) const {Complex num;num.real = real - rhs.real;num.imagine = imagine - rhs.imagine;return num;}// * operator overloadComplex Complex::operator*(const Complex &rhs) const {Complex num;num.real = real * rhs.real;num.imagine =…

#include <iostream> #include <string> #include <cstdlib> using namespace std; template<class T> T func(T a) { cout<<a; return a; } template<class U> void func(U a) { cout<<a; } int main(int argc, char const *argv[]) { int a = 5; int b = func(a); return 0; }       Give output for this code.

write a complete member function in class set defined by you in this code to count number of elements in intersection between 2 sets : the code is ::: using C++ Programming    #include <iostream> using namespace std; class Set{int n,set[10]; public: void create (){cout<<"Enter Number Of Elements:";cin>>n;int val;cout<<"Enter Elements in set:"<<endl;cin>>set[0];for (int i=1;i<n;i++){cin>>val;for (int j=0;j<i;j++){if (set[j]==val){i--;break;}else{set[i]=val;}}}cout<<"Set Created"<<endl;} void display (){for (int i=0;i<n;i++){cout<<set[i]<<" ";}cout<<endl;} void setUnion (Set *s2){Set s3;int x=0,y=0,z=0;while (x<n && y<s2->n){if (set[x]<(*s2).set[y]){s3.set[z]=set[x];x++;z++;}else if (set[x]==(*s2).set[y]){s3.set[z]=set[x];x++;y++;z++;}else{s3.set[z]=(*s2).set[y];y++;z++;}}while (x<n){s3.set[z]=set[x];x++;z++;}while (y<(*s2).n){s3.set[z]=(*s2).set[y];y++;z++;}s3.n=z;s3.display ();}…

Can help with this in c++The base class is given Base: class Base { int a;double b;public:Base (int _a, double _b) : a(1), b(2.5) {}Base (int _a, double _b) :a(_a), b (_b) {}double calct () {return 1.5*a+2*b;}string toString(){return "a="+to_string(a) + "b=" + to_string(b);}};Define a class Derived, successor to Base, with an additional field d of type double. For Derived, write constructors, write a new implementation of the calc () method to add to the sum and field d with coefficient 3 and the toString () method, which returns the text description of an object of class Derived.Create objects of class Derived with the written constructors and call the two variants of the methods calc () and toString () (of the class Derived and its base class Base)

C programming fill in the following code  #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…