The time complexity of computing the transitive closure of a binary relation on a set of elements is known to be:

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 the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is