Prove that when using a dynamic array that grows and shrinks as in the previous exercise, the following series of 2n operations takes O(n) time:   n append operations on an initially empty array, followed by n pop operations.

A maxHeap as follows, if it will be executed 3 times deletion. The following description about the storing Array for this maxHeap is right？ (Multiple choice) (without loss of generality, Array is arranged from left to right as A[1]~A[n], and N means NULL, no value)

Write a function for given main functionint * return_an_array(int n)which takes an integer n and returns a pointer to an array (allocated off of the heap inthe function) containing the digits of n in the appropriate positions. If n = 0 return 0(which is the “null” pointer). Recall an array name is just a pointer to the first element ofthe array. Please use following main to test your function.int main() {int *a = return_an_array(23542); // array of size 5for(int i=0;i<5;i++)cout<<a[i]<<" "; // print 2 3 5 4 2cout<<endl;delete [] a;int *b = return_an_array(12345678); // array of size 8for(int i=0;i<8;i++)cout<<b[i]<<" "; // print 1 2 3 4 5 6 7 8cout<<endl;delete [] b;return 0;}

Coding in Python, we have the function to perform this task, V col_Hdeg whichinputs the adjacency matrix A of the graph and initializes the array vert_color s tohold vertex colors. It then calculates the degree of each vertex and stores it in thearray degrees.The while loop iterates until all vertices are colored and at each iteration, thevertex v with the highest degree is colored. The array temp is used to find the currentcolors of the neighbors of vertex v and an unused smallest color is determined aftersorting this array.