please provide step by step calculation for each line of code, I am having trouble understanding how to calculate the time complexity . Thank you

Calculate the time complexity of the following method in terms of n. Full derivation of instruction count on each line is required. Note the dependency in the second loop (ja[j]){//assume worst case that this if is always true temp =a[j1] a[j1]=a[j] a[j]= temp; \} \} \} \} T(n)= ? Big-Oh=<>