An аlgоrithm cоntаins а nested fоr-loop. For an input of size n, the outer loop does n iterations and the inner loop does log(n) iterations. Each line of code in the algorithm does O(1) operations. What is the time complexity of the algorithm?