Find the time complexity (Big-O Notation) of the following code: int min Subsequence Sum (int a[]...

Find the time complexity (Big-O Notation) of the following code:

 

int min Subsequence Sum (int a[]){

                int n=a.size();

                int minSum = minSum2=0;

                int min1_i=min1_j=min2_i=min2_j=0;

                                for(int i=0; i

                                this sum += a[j];

                                if (this Sum < minSum){

                                minSum2 = minSum;

                                min2_i = min1_i;

                                min2_j = min1_j;

                                minSum = thisSum;

                                min1_i = I;

                                min1_j = j;

                                }

                                else if (thisSum < minSum2){

                                minSum2 = thisSum;

                                min2_i = I;

                                min2_j = j;

                                }

                }

}