Given a positive integer N, print all integers from 1 to N (inclusive) in increasing order using recursion. You must NOT use any loop (for, while, do-while). The function should use the call stack to print each number.
Input: A single integer N (1 ≤ N ≤ 10000).
Output: A list of integers from 1 to N in increasing order.
Input: 5
Output: [1, 2, 3, 4, 5]
Explanation: Base case: when the current number exceeds N, stop. Recursive case: call with n-1 first, then print n. Unwinding: 1, 2, 3, 4, 5.Input: 1
Output: [1]
Explanation: N=1, only one number to print. The function immediately hits the base case after printing 1.Input: 3
Output: [1, 2, 3]
Explanation: Recursion goes 3→2→1→base. On unwinding prints 1, then 2, then 3.1 <= N <= 1000