4. (2 pts) Each of the following functions describes the number of constant time operations done by an algorithm as a function of the input size, N. For each, give the asymptotic runtime class for the corresponding function (a) 15N + 2N2 + 100 (b) N log N + 2N (c) 2N + N2 (d) 101 + log(N2) 5. (2 pts) For the following two problems, run the algorithms manually (without the aid of programs or tools) (a) If you sort the array 8,3,5, 4, 7 using insertion sort, how many times do you swap two elements? (b) If you sort the array 8, 3, 5, 4, 7 using selection sort, is the number of times you swap two elements greater, less than or equal to the number of swaps you came up with for insertion sort