Push 13 to the following min-heap and write the resulting heap array in the answer space. Write the array like a normal C++ array (e.g.: {67, 54, 123, ...)). 54 51 62 27 59 28 50 3 44 22 24

char ** doubleIt (char **arr, int *maxsize); The doubleIt function will increase the heap size by doubling the original space. The functions takes 2 arguments: 1. A double pointer of type char called arr. This is a 2D dynamic array that contains words (strings) from the respective category (noun, verb, adjective, preposition). This is the original heap. 2. A pointer of type int called maxsize. This pointer holds the address of an integer that keeps track of the maximum amount of strings the 2D dynamic array can store. When this function is invoked, the current size of the dynamic array is at capacity so the values should match. This value will need to be multiplied by 2. The function allocates a new heap that is twice the size of the original heap and copy the values from the original heap into the new heap. One important note about this is that you have to properly copy the values over in order to avoid segmentation fault. Think about how this can be avoided. That is part of the…

Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*;    class GFG {        // A utility function to swap two elements     static void swap(int[] arr, int i, int j)     {         int temp = arr[i];         arr[i] = arr[j];         arr[j] = temp;     }        /* This function takes last element as pivot, places        the pivot element at its correct position in sorted        array, and places all smaller (smaller than pivot)        to left of pivot and all greater elements to right        of pivot */     static int partition(int[] arr, int low, int high)     {            // pivot         int pivot = arr[high];            // Index of smaller element and         // indicates the right position         // of pivot found so far         int i = (low - 1);            for (int j = low; j <= high - 1; j++) {                // If current element is smaller             // than the pivot             if…

java