Please follow the pseudocode...... If you can not do it as pseudocode then just leave it.

You only need to make it work for bases less than 10. So it should convert to binary and octal.

Pseudocode: Constructing Base b Expansions 1 procedure base b expansion (n, b: positive integers with b>1) 2 3 := n 4 5 k = 0 6 7 while 970 8 9 ak :=qmodb 10 11 q=qdivb 12 13 k:=k+1 14 15 return (base b expansion of n) Use the pseudocode above to write a C++ program that and tests the base conversion algorithm. The program should allow the user to enter a positive integer for n (the decimal value) and a positive integer greater than 1 for b (the base). Finally the program should print on the screen the result of the conversion. Sample output: Enter a positive integer: 52 Enter a value for the base: 2 52 = 110100 base 2