2.b. Given an algorithm that has best case time complexity T(n)∈θ(1)𝑇(𝑛)∈𝜃(1) and worst
case time complexity T(n)∈θ(nlogn)𝑇(𝑛)∈𝜃(𝑛𝑙𝑜𝑔𝑛). Based on the formal definition of big-O,
big-ΩΩ and big-θ𝜃 which one of the following statements is FALSE? Choose one answer and
note, if no case is given then the statement must apply to all cases (e.g. be true for both the
best case and worst case to be true)
i. 𝑇(𝑛)∈𝑂(𝑛)
ii. 𝑇(𝑛)∈𝑂(𝑛²)
iii. 𝑇(𝑛)∈Ω(𝑙𝑜𝑔𝑛) in the worst case
iv. 𝑇(𝑛)∈Ω(1)
v. 𝑇(𝑛)∈𝑂(1) in the best case

Can anyone answer this question for me?.