Brute force Algorithm Design Technique uses obvious, non-sophisticated approaches to solve problem in hand. Typically, they are only useful in small domains due to large overheads. One of the problems that can be solved via this technique is the closest-pair problem.

Given set of points in a 2D plane as in Table 1 : Find a pair of points with the shortest distance between them using brute force approach. (9 marks)