Consider the following three claims
I. (n + k)^m = $$\Theta \,({n^m})$$ where k and m are constants
II. 2ⁿ⁺¹ = O(2ⁿ)
III. 2²ⁿ = O(2²ⁿ)
Which of those claims are correct?

Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is

In a heap with n elements with the smallest element at the root, the 7^th smallest element can be found in time

What is the weight of a minimum spanning tree of the following graph?