5. (10 points ) Given an array a containing N Integers, provide a crisp and conce English description of an algorithm F for finding the farthest pair of integek For example, (-1,9) is the farthest pair in the array a = 14,9,3,-1, 6). (NO CODILUST EXPLAIN) 5.a) Vou hao wante on algoriththat works for M any are What is the running time of your algorithm (Don't need to explain why), 5.b) 6. (10 points +5 bonus points) Insert the following keys in that order into a maximum-oriented heap-ordered binary tree. EPSNKB MAY V E max at root) 6.a)