in python do it in 30 minutes

Q4. Prove or disprove the following (provide all steps with witnesses): [10 minutes) (3 Marks) [CLO 2] 1. T(n) = n2n is 0(21) 2. T(n) = n + log logna is O(n) Click or tap here to enter text. Q4. Prove or disprove the following (provide all steps with witnesses): [10 minutes) (3 Marks) [CLO 2] 1. T(n) = n2n is 0(21) 2. T(n) = n + log logna is O(n) Click or tap here to enter text