Given an array A of size n, we want to access the ith element in the array, Osien. What will be the time complexity of this operation? O(1) O(n2) O(n) O(logn) Question 13 Given an array A of size n, we want to find if an element k belongs to this array. What will be time complexity of this search operation? Assume that we don't know anything about the order of elements in the array. O(1) O(log n) O(n) O(n2)