Question: Can someone please answer part b and c for me, thanks! 5. (3.2.15,3.2.36, and 3.2 .37) Suppose that the complexity of an algorithm is given

Can someone please answer part b and c for me, thanks!
5. (3.2.15,3.2.36, and 3.2 .37) Suppose that the complexity of an algorithm is given by a function T(n). (a) What would it mean for T(n) to be O(1) - can an algorithm have complexity O(1) ? (b) What would it mean for T(n) to be (1) - can an algorithm have complexity (1) ? (c) What would it mean for T(n) to be (1) - can an algorithm have complexity (1)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
