undefined

Consider the following method. Describe the asymptotic execution time as a function of n using big. O notation: public int reverseNumber (int n) { int reverse = 0; while (n != 0) { reverse = (reverse* 10) + (n%10); n = n/10; ) return reverse; }