3 Give a formula that returns d, the minimum number of digits that are required to represent a given integer n 0 in base b (no justification is need). 4 5 Formally prove that the formula for computing d in the previous question is correct. Give the pseudocode of CONVERT(n, b), that returns an array of size d, for representing the integer n 0 in the base b 2. To get full credit, the proposed algorithm should have at most 10 lines. Using the integer division denoted by a b and the remainder of the integer division denoted by a mod b is recommended. In the sequel, we assume that integers are represented using a constant number of bits in a computer (typi- cally 4 bytes, i.e., 32 bits), which implies that all the operations on integers take constant time. 6 What is the running time of CONVERT?