What are the write answers and include the steps or definitions how you solve them?

PART II: Short Answer Questions 11) Please find number of the primitive operations (not Big-o) for the following algorithm Algorithm arrayFind(A,A): Input: An element x and an n-element array, A. output: The index i such thatx Ali or -1 if no element of A is equal to x. while i <>