Hi, I'd like some help understanding c & d, as well as the differences between Big-O, big-theta, and big-delta notation and the math used to solve them. Thank you

2. Suppose an algorithm solves a problem of size n in at most the number of steps listed for each T(n) given below. Calculate the asymptotic time complexity (big- or big-theta) for each T(n). Show your work, including values for c and no along the way. a) T(n) 1 b) T(n)= 5n-2 c) T(n)-3n3 +2 + n2 d) T(n) = log (n * 2n!)