The recurrence T(n) = 7T(n/2)+n2 describes the running time of an algorithm ALG. A competing algorithm ALG  has a running time of T (n) = aT (n/4)+  n2 log n. What is the largest value of a such that ALG is asymptotically faster than ALG?

the answer is 28

step-by-step explanation:

step-by-step explanation:

if u want da anser kill your teeser ifu hav wun

answer is x<

whole numbers.

step-by-step explanation:

we are given the average monthly rainfall (in millimeters) model r(m) for the years 1900-2009 as a function of the month number m.

as we can see m is taken for the number of months for years 1900-2009.

we know that number of months can't be a negative number or decimal number or a fraction.

so, the number of months could be only positive whole numbers.

therefore, whole numbers is more appropriate for the domain of r.