Consider the following algorithm. Inputs: an array A, indexed from 1 to 100 (We know that the integers from 1 to 100 appear in A exactly once each, in some unknown order.) O a single integer k, in the range 1 to 100 Algorithm R(A,k): found + false while not found rt a randomly chosen integer from the range 1 to 100 if (A[r]