give integer n return number range 1 n sorted lexicographical orderYou write algorithm run on time use O1 extra space example 1input n 13Output 11011121323456789example 2input n 2output 12 Constraints1 n 5 104