a) Design and give a pseudocode of a brute force algorithm to solve the two- dimensional closest pair problem which is defined as follows: Given a set of n points in a two-dimensional space where each point Pi is defined by its x-coordinate X[i] and its y-coordinate Y[i], find a pair of points (i.e., two points) with the smallest distance between them. Algorithm Closest Pair(X[1..n],Y[1..n]) { return index1,index2; } b) What is the time complexity of your algorithm? Hint: the distance between two point in a two dimensional plane (Xi, Yi) and (Xj, Yj) is: (Xi Xj)2 + (Yi Yj)2