4. Consider the Algorithm ARRAYFIND, given below, which searches an array A for an element x Input: An element x and an n-element array, AO,.., n-1]. (Indices start from 0) Output: The index i such that xA[i] or -1 if no element of A is equal to x ARRAYFIND(A, x) 2, while i n do 4 5.else 6. 1=1+1 7. return -1 return i Counting assignments, comparisons, and returns only, calculate the worst-case and best-case running times of ARRAYFIND. (Do not use asymptotic notations or parametric constants for this count the exact number of these three simple operations.)