3. 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. Run-time per instruction Frequency 1. 2. 3. 4. num_symbols ← 1 while n>r n ←n/r num_symbols ← num_symbols + 1 C₁ C₂ C3 C4 (a) Fill in for each line of instruction, the number of times (i.e., frequency) the instruction is executed. (b) Derive the expression for the run-time of the pseudo-code in terms of n, r, and C₁, C₂, C3, and C4. See questions 1 and 2 on how the final expression should be written. The parameters "describ- ing" the problem are n and r.