Which of the given options provides the increasing order of asymptotic Complexity of functions f₁, f₂, f₃ and f₄?
f₁ = 2ⁿ f₂ = n^3/2
f₃(n) = $$n\,\log _2^n$$
f₄ (n) = n ^log₂n

A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?

An undirected graph G(V, E) contains n ( n > 2 ) nodes named v₁ , v₂ ,….v_n. Two nodes v_i , v_j are connected if and only if 0 < |i – j| <= 2. Each edge (v_i, v_j ) is assigned a weight i + j. A sample graph with n = 4 is shown below. What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes?

An undirected graph G(V, E) contains n ( n > 2 ) nodes named v₁ , v₂ ,….v_n. Two nodes v_i , v_j are connected if and only if 0 < |i – j| <= 2. Each edge (v_i, v_j ) is assigned a weight i + j. A sample graph with n = 4 is shown below. The length of the path from v5 to v6 in the MST of previous question with n = 10 is