class Solution{
   int print2largest (int arr[],int n) {
    int largest=Integer.MIN_VALUE;
    int secondLargest=Integer.MIN_VALUE;
    for(int i=0;in;i++)
    {
         if(arr[i]largest)
         largest=arr[i];
    }
    for(int i=0;in;i++)
    {
        if(arr[i]secondLargest&&arr[i]largest)
        secondLargest=arr[i];
    }
       if(secondLargest==Integer.MIN_VALUE)
       retun-1;
       else
       return secondLargest;
   }
}
What will be the output, if you use the inputs like  12 35 1 10 34 1