CS 301 Data Structures Homework 1 (exam study guide) I. Suppose that by special measurement it has been discovered that the following functions describe the precise action of some algorithms. For each function, describe the asymptotic behavior in terms of big-Oh notation. a) 14 - 3 n + 712 b) (5 * log n) *(3*n) II. Consider the following program segment. Describe the asymptotic execution time as a function of n using big-Oh notation. In each case, you can assume that the remaining portion of the loop will require constant execution time. for (int i = 0; i<>