$2.$ Minimum Cost to Connect PointsYou are given a set of n points on a $2$D plane. Each point is represented by its coordinates $($x$,$ y$).$ You need to connect all the points with edges, such that the total cost of connecting all points is minimized. The cost of connecting two points $($x$1,$ y$1)$ and $($x$2,$ y$2)$ is the Manhattan distance $|$x$1-$ x$2|+|$y$1-$ y$2|.$Input: The first line contains an integer n $$ the number of points. Each of the next n lines contains two integers x and y $$ the coordinates of the points.Output: Print the minimum total cost to connect all points.