Code:#include <stdio.h> int main(){ int N,min,max,i,j,temp; printf ("Enter N.\n"); scanf ("%d",&N); int polje[N]; for (i=0;i<N;i++){ printf ("Enter %d. number:\n",i+1); scanf ("%d",&temp); polje [i] = temp; } i=0; max = polje[i]; for (i=1;i<N;i++) if (polje[i]>max) max = polje[i]; i=0; min=polje [i]; for (i=1;i<N;i++) if (polje[i]<min) min = polje[i]; printf ("%d is biggest, and %d smallest.\n",max,min); // Find and print out only the closest prime number to the max //Need help here... return 0; }