Pick the growth rate that corresponds to the most efficient algorithm as n gets large: 4h n3 on2 log (log n) n2 logn Question 9 A recurrence relation is often used to model programs with for loops. branch control like "if" statements. recursive calls. O function calls