Data Structure class

4. For each of the following, determine the asymptotic rate in notation for the input n. (a) int value =0; for (int i=1;ival) \{ val=arr [i]; \} \} return val; \} Explain what this method returns when an array of integers is passed in to it. In the input array is of length n, classify the complexity of this algorithm using O,, as appropriate. The name nysteryNethod isn't a good name. What would a more appropriate name be? 6. Recall the two implementations for lists that we studied: array-based lists (AList) and linked lists (LList). For lists of length n, fill in each blank from these choices. A=O(1),B=O(log(n)),C=O(n). (a) Inserting to an AList requires operations. (b) Inserting to an LList requires operations. (c) Deleting from in AList requires operations, (d) Deleting from an LList requires operations. (e) A binary search on an AList requires operations. (f) A sequential search on an LList requires operations