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

Ram and Shyam have been asked to show that a certain problem Π is NP-complete. Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these reductions ?

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