What is the Big-O time complexity of theconversionfunction in terms ofn?

// Description // number is a positive integer with n digits, where number_irefers to the i^thdigit of number // n is the number of digits of c // base is a positive integer

function conversion(number,base,n) value = 0; unit = 1; for i = 0 to n value = value + number_i* unit; unit = unit * base; end return value;