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 C1 C2 C3 C4 num symbols + 1 while n>r 1. 2. +n/r num symbols + num symbols + 1 3. 4. (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 Cj