Write a function solution that, given an integer N, returns the smallest number with the same number of digits. You can assume N is between 1 and 10⁹ (a billion). For example, given N = 125, the function should return 100. Given N = 10, the function should return 10. Given N= 1, the function should return 0. required in C language hurry up please no.time.

Write a C++ function factorial that takes an integer, n, and returns the value of n factorial (a.k.a., n!): When n is positive, n! = 1 * 2 * 3 * ... * n.  For example, 5! = 1 * 2 * 3 * 4 * 5 = 120. When n is zero, n! is defined to be 1. When n is negative, n! is undefined. You may assume that the parameter n will not be negative for this problem.

language: Python   Problem:  Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. When creating the function, also create a test case to prove the program works. The pseudocode is: # Base case: if b is 1, you can just return a + 1# General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1