Consider the following three functions.

f₁ = 10ⁿ, f₂ = n^logn, f₃ = n^√n

Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

Consider the following array.

23

32

45

69

72

73

89

97

Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort above array in ascending order?

Consider the following undirected graph with edge weights as shown:

The number of minimum-weight spanning trees of the graph is ______

Consider the following recurrence relation.

$$T(n) = \left\{ {\begin{array}{*{20}{c}} {T(n/2) + T(2n/5) + 7n \ \ \ if\ n > 0}\\ {1\ \ \ \ \ \ \ if\ n = 0} \end{array}} \right.$$

Which one of the following option is correct?