Problem 3-2 (Identity Element in an Array) 10 Points Let A be an array with n distinct integer elements in sorted order. Consider the following algorithm IDFIND(A, j, k) that finds an i E {j... k) such that Afi]-i, or returns FALSE if no such element exists. 1 IDFIND(A, j, k) 3 Set i-... if j k return FALSE 4 if A... return 5 if Ali