Can I get a test driver for this code? #include using namespace std;   template T* subarray(const T* a, int i, int m){     T* subArr = new T[m];     int index = 0;     for(int j=i; j < m+i-1; j++){         subArr[index] = a[j];         index++;     }     return subArr; }

Re-write Sample Program 11.2 so that it works for an array of structures. Write the program so that it compares 6 circles. You will need to come up with a new way of determining which circle’s center is closest to the origin.   Sample code 11.2   #include <iostream>#include <cmath> // necessary for pow function#include <iomanip>using namespace std;struct circle // declares the structure circle{ // This structure has 6 membersfloat centerX; // x coordinate of centerfloat centerY; // y coordinate of centerfloat radius;float area;float circumference;float distance_from_origin;};const float PI = 3.14159;int main(){circle circ1, circ2; // defines 2 circle structure variablescout << "Please enter the radius of the first circle: ";cin >> circ1.radius;cout << endl<< "Please enter the x-coordinate of the center: ";cin >> circ1.centerX;cout << endl<< "Please enter the y-coordinate of the center: ";cin >>…

can someone help me with this in C++ You'll need to complete the following two step: implement bubble sort algorithms as a function. call the bubble sort function in the main.this is the code I have so far #include <iostream> #include <vector>  using namespace std; void get_value(int *ptr, int size){  for(int i=0; i < size; i++){    ptr[i] = rand() % 100;  }} void bubble_sort(int *ptr, int size){ //complete the code } int main(){  int *myarray = new int[10];  get_value(myarray, 10);       //implement a bubble sort function to sort the array             return 0;}

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:…

This is What i have so far.   #include <iostream> // for cin and cout#include <iomanip> // for setw() and setfill()using namespace std; // so that we don't need to preface every cin and cout with std:: void printFirstTwoBuildingSection(int n, int startSpacing){int start = n / 2, end = 0;if (n <= 2){start = 0;}for (int i = 0; i < n; i++){for (int j = 0; j < startSpacing; j++){cout << " ";}cout << "|";if (i < (n / 2)){for (int k = 0; k < i; k++){cout << " ";}cout << "\\";for (int k = 0; k < start; k++){cout << " ";}cout << "/";start -= (n / 2);for (int k = 0; k < i; k++){cout << " ";}cout << "|" << endl;}else{for (int k = n - i - 1; k > 0; k--){cout << " ";}cout << "/";for (int k = 0; k < end; k++){cout << " ";}cout << "\\";end += (n / 2);for (int k = n - i - 1; k > 0; k--){cout << " ";}cout << "|" << endl;}}for (int j = 0; j < startSpacing;…