1 Give the time complexities (Big-o notation) of the following running times expressed as a function of the input size N. a) N2 25N108 b) N + 31ogN 12nvn c) 12NlogN + 15N 1ogN d) Arrange the following Big-o notations from the least expensive to the most expensive (or slowest to fastest), in terms of time complexity. O (N!, O (logN), O (N3), O (1), O (N1ogN), O (N2), 0 (2N), 2 Answer the questions that follow given the java