void main(){int a[20],f=0,i,n,srch;printf("\nhow many numbers u want to insert(<=20)");scanf("\n%d",&n);for(i=0;i<n;i++)scanf("\n%d",&a[i]);printf("Enter the numbers you want to search\n");scanf("\n%d",&srch);for(i=0;i<n;i++){ if(a[i]==srch) { f++; break; }}if(f==0)printf("\nnumber not found");elseprintf("\nnumber is found at %d position",i);}

You are given a sequence of integers as input, terminated by -1. (That is, the input integers may be positive, negative or 0. -1 in the input signals the end of the input.) -1 is not considered as part of the input. Find the second largest number in the input.