Question 3 3 Points The following algorithm is to find the position of the first encountered integer value k in an array A of size n. 1. What are the primitive operations in the algorithm? 2. Calculate T(n); the number of times the primitive operations are executed in the worst case. 3. What is the big oh (the complexity) of the algorithm? Algorithm findkey (A, n, k) Input array A of n integers, and an integer k Output position of the first encountered value k in A p = -1 i = 0 while (i