Provide a pseudo-code for an algorithm that solves closest pair problem, using brute-force technique and analyze it. a. (7 points) Write a pseudo-code for brute-force string matching algorithm. b. (4 points) What is the input size? C. (2 points) What is the basic operation? d. (5 points) How many time the basic operation executed? e. (2 points) What is the efficiency class of this algorithm? Indicate the class (g(n)) the function belongs to. (Use the simplest g(n) possible in your answers.) ALGORITHM Brute ForceClosest Pair(P) 7 Finds: distance between two closest points in the plane by brute force :7 Input: A list P of n(n > 2 points p1(x1, y),..., pn(xn, yn) ./ Output: The distance between the closest pair of points