Suppose we have the following functions: n2, 2", log n Which order of the functions so that each function is big-O of the next function. (1) log n

Extracted text: Suppose we have the following functions: n2, 2", log n Which order of the functions so that each function is big-O of the next function. (1) log n < n²="">< 2"="" (2)="" log="" n="">< 2"="">< n²="" (3)="" n²="">< log="" n="">< 2"="" (4)="" 2"="">< log="" n="">< n?="" a="" choice="" (3)="" b="" choice="" (1)="" (c)="" choice="" (4)="" d="" choice="">