Given a function f: A B, where |A| = m and |B| = n, use pseudo-code to describe an algorithm that will determine if the function is "onto." You may assume that the sets are represented as arrays. Prove the time complexity of the pseudo-code. (Onto meaning that all values of B have one or more corresponding values of A such that f(A) = B)

Thanks!