What is the computational complexity of the following code snippet: result = 0; for(i = 0; i < n; i++) for(j = 1; j < 10; j = j* 2) result *= i * j; a. O(n)

Can someone please clarify why this is O(n) and not O(n^2) like I thought it was? Thank you