Determine the big-O notation for the followings: (2pts) (n*log(n)) + (n^4) (5'n'n) + (n^(3/2)) In the following code segment, if the algorithm dolt has an efficiency factor of 5n, calculate the run-time efficiency of the program and determine its big-O notation, (4pts) for (int i=1; i