3. (10 points.) Suppose that A is an array that is organized as a min-heap of integers, and that e is an integer. Write an algorithm IS-IN-MIN- HEAP(A, e) that returns true if e is an element of A, and returns false otherwise. Your algorithm must not change A, and it must not make copies of A. It must avoid visiting all elements of A if possible, so it must not use linear search. You may state your algorithm in Cormen's pseudocode, or in a programming language. 3. (10 points.) Suppose that A is an array that is organized as a min-heap of integers, and that e is an integer. Write an algorithm IS-IN-MIN- HEAP(A, e) that returns true if e is an element of A, and returns false otherwise. Your algorithm must not change A, and it must not make copies of A. It must avoid visiting all elements of A if possible, so it must not use linear search. You may state your algorithm in Cormen's pseudocode, or in a programming language