Question about counting primitive operations

I want to know why If statement excute 2(n-1) and whats inside is 0..2(n-1)? With explanation if possible

I have struggle with these kind of questions

public static int max(int a[]) not nt1 cus we sem operations fat int m=a[0]; & for (int i=1;im)s m=a[i];