Show an array of 6 integers that will give the minimum number of comparisons to sort the array, by inserting the elements into a MinHeap (one by one) and delete the elements one by one (use the Insert and Delete functions of MinHeap. Please count the number of comparisons only (not the swaps).

Given an array with 200 rows and 800 columns. Thearray already contains data. Write the code required in C tooutput the sum of all the elements in the last 50 rows.

Let N be an unordered array of integers. The maximum number of compares required to find the minimum value is N. Select one True or False

Use the digits of your CUNY Emplid as elements of an array. Sort the digits using selection sort. Show your work using a new row to show the order of the digits in the array after each swap. id:23878727

Note : Don't Explain .

Write an algorithim DELETE(A,N,POS) to delete an element at POS. You can use the following array to implement your algorithim {3,8,12,5,6} This can be pseudocode

Write an array that matches the following requirement, and provide explanation of how you got your answer.--> Using a insertion sort on the array compared to using a selection sort requires FEWER comparisons of elements.