Write a RISC-V program that allocates an n×n array of integers on the heap, where n is a user input. The program should compute and print the value of each element as follows: for (i=0; i0) a[i][j] = a[i][j] + a[i-1][j]; if (j>0) a[i][j] = a[i][j] + a[i][j-1]; print_int(a[i][j]); print_char(' '); } print_char('\n'); }

Reverse the order of a n-element array in C What am I doing incorrectly and how can I fix? My code: #include <stdio.h> sort(int *p, int m) { //Write your code here for(int i = 0; i<n/2; i++){ temp = arr[i]; arr[i] = arr[n-i-1]; arr[n-i-1] = temp; } } main(){     int i, n;     int *p, num[20];     printf("input n:");     scanf("%d", &n);     printf("please input these numbers:\n");     for (i = 0; i < n; i++)         scanf("%d", &num[i]);     p = &num[0];     sort(p, n);     printf("Now, the sequence is:\n");     for (i = 0; i < n; i++)         printf("%d ", num[i]); }

Provide the program in C language for the pseudocode given below.

We push all the elements of an array A in order (starting from index 0 of the array A) into a stack. We then pop all the elements from the stack and store them in order (starting from index 0) in A. Which of the following is true after all pop operations complete? O The elements of A are reversed Each element of A is in its original location O The elements of A are in random new locations The array A is empty O None of the above

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…