The same principle used in Fibonacci coding can be used for encoding integers with the prime numbers augmented by the number 1 ({1, 2, 3,5, 7,11,13,17...}). The difference, however, is that the code produced is not unique (it is UD but not unique).

a.Find the Fibonacci code for the integer 250.

b.Find the Fibonacci-like code with the least number of bits for the integer 26 using primes (augmented by 1) instead of Fibonacci numbers.