Given a positive integer n$,$ i$.$e$.,$ n $>0,$ and a radix r$,$ where r $>=2,$ the following pseudo$-$code

computes the number of symbols required to represent n with radix r$.$ Note that r is an integer.