1.a)Write a pseudo-code for the “closest-pair” problem. In thisproblem, you will determine the closest number pair in a givenrandomly order number array. For example assume your array A is asfollows:
A = [2, 20, 35, 28,45, 23, 67, 21, 95, 15]
Your program (orpseudo-code) will find the indices of closest numbers in the array.In the above array A, 20 and 21 are the closest pairs.
1.b)Perform a complexity analysis of your algorithm as I did in thevideo tutorial. What is the best-case, average-case, and theworst-case scenarios?
———————————–
2.a)Write a pseudo-code for “binary search” problem. In this problem,you will search
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured