Suppose an algorithm takes exactly the given number of statements for each value below, in terms of an input size N. Give a tight big-Oh bound for each algorithm, representing the closest complexity class for that algorithm based on that runtime.

a. ½N log N + log N

b. N² − (N + N log N + 1000)

c. N² log N + 2N

d. ½(3N + 5 + N)

e. (2N + 5 + N⁴)/N

f. log (2^N)

g. N! + 2N