What is the order(Big-Oh or computational complexity) of the following methods?

Method 1:

public int mystery1(int n )

{

int sum = 0;

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

{

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

{

sum += i * j;

}

}

return sum;

}

Method 2:

public int mystery2(int n )

{

int sum = 0;

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

{

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

{

sum += j * n;

}

}

return sum;

}