using c++  #include using namespace std; int main() {     int n = 5;     for (int row = 0; row < n; row++) {           for (int col = 0; col < n; col++) {                  cout << "*";        }         cout << endl; } } ) SecondTriangle. Using the above square code, write a code fragment secondTriangle that reads in an integer n and displays the following triangle assuming n=5. The only couts you may use are cout <<“*”, cout <<”-“, and cout << endl;. Hint: write out a table showing for each row, how may columns you will need to display.   ----* ---** --*** -**** *****

Please complete the following guidelines and hints. Using C language. Please use this template: #include <stdio.h>#define MAX 100struct cg { // structure to hold x and y coordinates and massfloat x, y, mass;}masses[MAX];int readin(void){/* Write this function to read in the datainto the array massesnote that this function should return the number ofmasses read in from the file */}void computecg(int n_masses){/* Write this function to compute the C of Gand print the result */}int main(void){int number;if((number = readin()) > 0)computecg(number);return 0;}Testing your workTypical Input from keyboard:40 0 10 1 11 0 11 1 1Typical Output to screen:CoG coordinates are: x = 0.50 y = 0.50

demo.cpp   #include "Poly.h" #include<iostream> using namespace std; int main() {    Poly p1;     couble d[3]={1,2,3}:    Poly p2(3, d);    Poly p3(p2);     cout << "Polynomial p1 is: ";    p1.display();    cout << "Polynomial p2 is: " << p2 << endl;    cout << "Polynomial p3 is: " << p3 << endl;     if (p2 == p3) {        cout << "p2 and p3 are the same.";    }    else {        cout << "p2 and p3 are different.";    }    cout << endl;     cout << "The coefficient of power 1 of p3 is: " << p2.getCoef(1) << endl;    p3.setCoef(1, 99);    cout << "p3 after setup is: " << p3 << endl;    if (p2 == p3) {        cout << "p2 and p3 are the same.";    }    else {        cout << "p2 and p3 are different.";    }    cout << endl;    Poly p4;    cout << "Please enter the power and coefficients of Polynomial p4: " << endl;    cin >> p4;    cout <<…

In C++ Assume that a 5 element array of type string named boroughs has been declared and initialized. Write the code necessary to switch (exchange) the values of the first and last elements of the array.

This is the C code I have so far  #include <stdio.h> #include <stdlib.h> struct employees {     char name[20];     int ssn[9];     int yearBorn, salary; };   // function to read the employee data from the user void readEmployee(struct employees *emp) {     printf("Enter name: ");     gets(emp->name);     printf("Enter ssn: ");     for (int i = 0; i < 9; i++)         scanf("%d", &emp->ssn[i]);     printf("Enter birth year: ");     scanf("%d", &emp->yearBorn);     printf("Enter salary: ");     scanf("%d", &emp->salary); }   // function to create a pointer of employee type struct employees *createEmployee() {     // creating the pointer     struct employees *emp = malloc(sizeof(struct employees));     // function to read the data     readEmployee(emp);     // returning the data     return emp; }   // function to print the employee data to console void display(struct employees *e) {     printf("%s", e->name);     printf("  %d%d%d-%d%d-%d%d%d%d",…

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