Min Cost to Connect All Points

You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [x_i, y_i], points will be of dimension (n * m)

The cost of connecting two points [x_i, y_i] and [x_j, y_j] is the manhattan distance between them: |x_i - x_j| + |y_i - y_j|, where |val| denotes the absolute value of val.

Return the minimum cost to make all points connected. All points are connected if there is exactly one simple path between any two points.

Input Format:

2D Array/List representing the integer co-ordinates

Output Format:

integer - the minimum cost to connect all the points

Sample Tests:

Case1:

points = [[0,0],[2,2],[3,10],[5,2],[7,0]]
result = 20
Explanation:
We can connect the points as shown below in the figure to get the minimum cost of 20.
Notice that there is a unique path between every pair of points.

Example 2

points = [[3,12],[-2,5],[-4,1]]
result = 18

Constraints:

• 1 <= points.length <= 1000
• -106 <= x_i, y_i <= 106
• All pairs (x_i, y_i) are distinct.