Exercise $2$: $($Brute Force: Closest Pair$)$

PART A: The brute force algorithm for finding closest pair of points in $2$D space is given below:

Write a code to implement this algorithm in the language of your choice. Paste your complete code here:

PART B: Run your code for the following inputs:

p $=[(3,2),(3,6),(7,12),(3,1),(9,18),(8,56)]$;

Write the output of your code below: