What is the complexity of the given code as a function of the problem size n? Show all of the details of your analysis.

for (int i = 0; i < 2*n; i++)

{

if (i == n)

{

for (int j = 0; j < i; j++)

for (int k = 0; k < i; k++)

O(1)

}

else

{

for (int j = 0; j < i; j++)

O(1)

}

}

I need help to find each line time complexity like 1st line will run how many time and best and worst case...please