Write an isMinHeap function that takes in a pointer to an integer array as the first parameter and an integer representing the array's size as the second parameter. This function shall return true if the array is in min heap order. That is, does the array, in its current configuration, meet the requirements for a minimum heap? If so, it returns true and if not it returns false. You do not need to code for negative length arrays. (Assume valid input). int main(){ int arr[] int bev[] std::cout << "Min Heap? {1,2,3,4,5,7,9}; {9,0,2,1,0}; %3D %3D « isMinHeap(arr, 7) <« std::endl; « isMinHeap(bev,5) %3D std::cout « "Min Heap? <« std::endl; Output: Min Heap? 1 Min Heap? 0

Objectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab - arrayImpOfStack.java // it represents an array implementation of the stack. - pointerImOfStack.java // it represents a Linked List implementation of the stack. - pointerImOfQueue.java // it represents a pointer implementation of the queue. Then the students by themselves are required to write the code for the following questions Ex1) Given the file arrayImpOfStack.java then write a main method to read a sequence of numbers           and using the stack…

Please help me with my c++ homework.  My question is about this part of the code given by the professor: temp = list[index]; list[index] = list[index+1]; list[index+1] = temp; Since this question is asking to set the array in descending order, what if the question asks to sort the array in ascending order. Should I wrote the code like "temp = list[index]; list[index-1] = list[index]; list[index] = temp;". Am I correct?  This is my c++ homework question and answer.  The below function will sort an integer array in ascending (increasing) order. After calling sort the smallest element will be at index 0, the next smallest at index 1, etc. What would you need to change to sort the array in descending (decreasing) order? void sort( int list[], int length ) { int index, temp; bool sorted = false; while ( !sorted ) { sorted = true for ( index = 0; index < length - 1; index++ ) if ( list[index] < list[index+1] ) { temp = list[index]; list[index] = list[index+1]; list[index+1] = temp;…

8