ICrOSO t.MicrosoftEdge e/Downloads/Assignment 1.pdf CS 3330 Assignment 1 (Due: at 11:59PM on 3/25/2018) 1.a) Writ a pseudo-code for the "closest-pair" problem. In this problem, you will determine the closest number pair in a given randomly order number array. For example assume your array A is as follows: A 12,20, 35, 28, 45, 23, 67, 21, 95, 15) Your program (or pseudo-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 the video tutorial What is the best-case, average-case, and the worst-case scenarios? 2.a) Write a pseudo-code for "binary search" problem. In this problem, you will search an element in a sorted array. For example: A [1, 4,7,9, 12, 24, 56, 61, 62, 65, 89] If the search element is 12, your algorithm must find its index 2.b) Perform a complexity analysis for your algorithm as I did in the video tutorial. What is the best, average, and worst case