Please help ASAP, currently on a time constraint! Ashley loves numbers made up of unique digits. She is less enchanted with numbers that have repeating digits. Given a range of integers, determine how many numbers she will love. For example, the lower bound n$=80$ and the upper bound m$=120.$ Both are inclusive, so there are $120-79=41$ values in the range. Numbers she loves are green. Others are red. The two columns to the right are the love$/$hate counts per row. $8991809010818291921010839310849410859510869610878897981010234567$ There are $27$ numbers she loves and $14$ other O numbers in the range. Function Description Complete the function countNumbers in the editor below. For each bounds pair arr$[$i$],$ it must print the number of integers in the inclusive range that Ashley loves.Complete the function countNumbers in the editor below. For each bounds pair arr$[$i$],$ it must print the number of integers in the inclusive range that Ashley loves. count Numbers has the following parameter$($s$)$: arr$[$arr$[$namal$,$arr$[$n $1,$ m $)...$arr$[$ng$-1,$ m$,-1]]$: an array of integer pairs representing lower and upper range limits Constraints $159$ s $1051$snsm $<1061$ # #include $...1011//$ Complete the countNumbers function below. void countNumbers $($vector$>$ arr$)\{$