Please do 1-5 do answer the Question.

1. Complete pseudocode 2. Identify the input and the input size, n 3. Identify the elementary operation 4. Compute how many times the elementary operation is executed with respect to the input size n 5. Provide a Big-O asymptotic characterization for the algorithm's complexity 10 points Consider the following problem: Given a set of n points in the plane, P- (zi, yi),p2 = (T2,Y2), ,pn = (zn,Yn), determine which pair pi, pi are closest. The distance between any two points, Pa = (za,%), pb = (zb,y) in the plane is Write pseudocode to determine the two closest points among a collection of n points. Analyze it by: identifying the input/input size, identifying the elementary operation and how often it gets it gets executed with respect to the input size and provide an asymptotic characterization