You are given an array of integers, each with an unknown number of digits. you are also told the total number of digits of all the integers in the array is n. provide an algorithm that will sort the array in o(n) time no matter how the digits are distributed among the elements in the array. (e. g. there might be one element with n digits, or n/2 elements with 2 digits, or the elements might be of all different lengths, etc. be sure to justify in detail the run time of your algorithm.

step-by-step explanation:

if x = 2 you have to find x to finish the problem

answer is b

step-by-step explanation:

step-by-step explanation:

let's assume

number of candles set =x

price of of x candles =p(x)

we are given

a candle maker prices one set of scented candles at $10 and sells an average of 200 sets each week

so, we get point as (200,10)

he finds that when he reduces the price by $1, he then sells 50 more candle sets each week

so, we can find slope

now, we can use point slope form of line

now, we can plug values

we can use point

and find b

now, we can plug it back

and we get

now, we can find revenue

we know that

revenue = price*quantity

so, we get