Q. implement a python program to short array [64, 34, 25, 12, 22,11,98] using merge sort.

Use C++ to program an array of numbers 58 to 93. There should be a slice with numbers divisible by 7 and another with prime numbers.

Suppose we apply the Mix Columns operation to a *column* vector [0x19, 0x85, 0x91, 0x02] (given with bytes in hex). What are the entries of the resulting column (in decimal)?

Consider an array of length 5, arr[5] = {9,7,4,2,1}. What are the steps of insertions done while running insertion sort on the array? a) 7 9 4 2 1     4 7 9 2 1   2 4 7 9 1   1 2 4 7 9 b) 9 7 4 1 2     9 7 1 2 4   9 1 2 4 7     1 2 4 7 9 c) 7 4 2 1 9      4 2 1 9 7      2 1 9 7 4    1 9 7 4 2 d) 7 9 4 2 1     2 4 7 9 1    4 7 9 2 1     1 2 4 7 9

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…