What is the time complexity of these [ Sum += y is a short form notation for Sum = Sum + y.] for (int i = 1 to n) { for (int j = i to n) { for (int k = j to n) { Sum + a[i]*b[j]*c[k] 1) { } } If (gcd(i, j) j = n } == j = 1 while (j

Question 4

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.