Can someone explain a method to solve this the simplest way? Im bad at big oh.

35. Arrange the following functions in a list so each is big-O of the next one in the list: n +Inn",2"+3",n + nvn,n2", In(n! 36. Arrange the folloving functions in a list so each is big-O of the next one in the list: vn, logn100, n10, log(10"), log(n"), n!, 3", log(n!)