$1.$ Distinct Digit NumbersGiven a range of integers, determine how many numbers have no repeating digits.Example n$=80$m$=120$The lower and upper bounds are inclusive, so there are $120-79-41$ values in the range. Numbers without repeating characters are normal weight and others are bold. The two columns to the right are the valid number counts per row $($normal weight$)$ and invalid number counts $($bold$).$Language Python $31$ #$!/$bin$/$python $-10$# Complete the countNumbe$12$def countNumbers $($arr$)$:$1314>$ ifname$==-\_$main$\_-\text{'}$:$808182838485868788899190919293949596979899911001011021031041051061071081098211011111211311411511611711811910120$There are $27$ numbers with no repeating digits, and $14$ other numbers in the range. Print $27.$Function DescriptionComplete the function countNumbers in the editor below.countNumbers has the following parameters$)$:int arr$[$qJ$[2)$: integer pairs representing inclusive lower $($n$)$ and upper $($m$)$ range limitsPrintFor each pair arr$($i$],$ print the number of integers in the inclusive range that qualify. There is no value to return from the function.Constraints $1591051505$m$ $106$ Input Format for Custom Testing Sample Case $0$Sample Input $0$STINFunction$20$arrl$]$ size q $=2$arr$[$il$[]$ size $=2($always$)$arr $=$ C$[2,201,[9,1933$Sample Output $0$Explanation $0$Row $0-[1,20)$The set of qualifying numbers in the Inclusive range between nO$]-1$ and m$[0]=20$ ls $(1,2,3,4,5,6,7,8,910,12,13,14,15,16,17,18,19,20)$ This Rives US c$/01=19$