ANSWER IT PLEASE QUICK: Find the big-O complexity of the following algorithm (and explain why):

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

for (int j=1; j<=3*n; j++)

for(int k=1; k<=4*n; k++)

cout << i + j + k << endl;

thank you