***Please answer all the following (Computer science) Discrete math question completely.***

Q2. Growth of functions. In each of the following cases, either construct a function /() that satisfies the specified constraints or state that no such function exists. (2pt each) b, (n)-(n2) and/(n)-O (n + n') In the following two questions, arrange the functions in a list so that each function is a big-O of the next function. (2pt each) d. nlog n, V', log n, (log2n+log n+n), 12 n, (n!), log log() e. 2"+1 n, (n