bool palindrome(const int a[], int start, int end); This function is to return true if elements from a[start] to a[end] can be printed the same forward and backwards. For example, given the following array: int test[] = {1, 2, 1, 2, 1}; . • palindrome(test, 0, 4) shall return true because the whole array prints the same forward and backward. • palindrome(test, 1, 1) shall return true any single element prints the same forward and backward. ● 1 palindrome(test, 1, 3) shall return true because {2, 1, 2} prints the same forward and backward. palindrome(test, 2, 3) shall return false because printing these elements forward would be {1, 2} while printing them backward would be {2, 1}. Identify a few more test cases with more array elements and check with the lab instructor to ensure you have understood the idea of palindrome before working on the implementation. functions. Capture screenshot(s) of sample run(s) to demonstrate thorough testing for the above

C++ language

#include <bits/stdc++.h>using namespace std;int main() { double matrix[4][3]={{2.5,3.2,6.0},{5.5, 7.5, 12.6},{11.25, 16.85, 13.45},{8.75, 35.65, 19.45}}; cout<<"Input no in first row of matrix"<<endl; for(int i=0;i<3;i++){     double t;     cin>>t;     matrix[0][i]=t; } cout<<"Contents of the last column in matrix"<<endl; for(int i=0;i<4;i++){     cout<<matrix[i][2]<<" "; } cout<<"Content of first row and last column element in matrix is: "<<matrix[0][3]<<endl; matrix[3][2]=13.6; cout<<"Updated matrix is :"<<endl; for(int i=0;i<4;i++){     for(int j=0;j<3;j++){         cout<<matrix[i][j]<<" ";     }cout<<endl; } return 0;}   Please explain this code

#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; }

use c++ Programming language  Write a program that creates a two dimensional array initialized with test data.  Use any data type you wish .  The program should have following functions: .getAverage: This function should accept a two dimensional array as its argument and return the average of each row (each student have their average) and each column (class test average) all the values in the array. .getRowTotal: This function should accept a two dimensional array as its first argument and an integer as its second argument.  The second argument should be the subscript of a row in the array. The function should return the total of the values in the specified row. .getColumnTotal:  This function should accept a two dimensional array as its first argument and an integer as its second argument.  The second argument should be the subscript of a column in the array. The function should return the total of the values in the specified column. .getHighestInRow: This function should accept a two…

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