What is the output from the following code snippet int main() { } for (int i = 0; i < 6; i = i + 2) { } ostringstream oss; oss << "base-" <

Please Help In JAVA   Here is the skeleton of a code for insertion sorting in an imperative language. You have to add right lines of codes for the language you choose (C, C++, C#, JAVA etc,). The following sample is for C++.   #include <iostream>#include <array>#include <stdio.h>#include <stdlib.h>#include <ctime>using namespace std; void insertionSort(int A[], int n){for (int i = n-2; i >= 0; i--){ int j; int v = A[i]; for (j = i + 1; j <= n-1; j++) {  if (A[j] > v)   break;  else  A[j-1] = A[j];  } A[j-1] = v;}} int *randomArray(int n){srand((unsigned) time(0));int * A = new int [n];for (int i = 0; i < n; i++){ A[i] = rand();}return A;} Sample function calls (call these functions in main driver function):int n = 100000;int * A = randomArray(n);insertionSort(A, n);delete [] A;   Note: delete memory of first array before sorting second array. After you modify the code: (1) Generate 100, 000 random numbers and sort them (2) Generate 300000…

C+++ Coding I need help wtih Pointer Basics Please see attached.

I need memory drawing of this program #include<iostream>using namespace std;class student{string name;int id;float gpa;public:student* next;//next = &student;void getdata(){cout<<"Enter the name of the student "<<endl;cin>>name;cout<<"Enter the id "<<endl;cin>>id;cout<<"Enter gpa "<<endl;cin>>gpa;}void showdata(){cout<<"Student name : "<<name<<" Id: "<<id<<" gpa "<<gpa<<endl;}};// ....int main(){student* s[10];for (int i = 0; i < 8; i++){cout << "enter student data\n";s[i] = new student(); //create objects[i]->getdata();s[i]->next = s[i + 1];}for (int i = 0; i < 8; i++){s[i]->showdata();}}

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