Suppose that A is an array whose integer elements are organized into a max-heap. Also suppose that e is an integer. Write an algorithm IS-IN-MAX-HEAP(A, e) that tests if e is an element of A. Your algorithm must not change A, and it must not make copies of A. It must avoid visiting all elements of A where possibleso it must not use linear search. You may state your answer in English, in Cormens pseudocode notation, or in a programming language.