You are given six two-dimensional points shown in the table below. Point x coordinate y coordinate pi 0.1831 0.1085 P2 0.9624 0.1916 p3 0.0732 0.9594 P4 0.2572 0.6066 Ps 0.4476 0.7871 P6 0.2292 0.9489 Use the Euclidean distance to compute the distance matrix M for the six points. Show the results of the complete linkage version of the basic agglomerative hierarchical clustering algorithm. That is, for each iteration of the algorithm, you need to show the found closest two clusters and the updated distance matrix M. You are given six two-dimensional points shown in the table below. Point x coordinate y coordinate pi 0.1831 0.1085 P2 0.9624 0.1916 p3 0.0732 0.9594 P4 0.2572 0.6066 Ps 0.4476 0.7871 P6 0.2292 0.9489 Use the Euclidean distance to compute the distance matrix M for the six points. Show the results of the complete linkage version of the basic agglomerative hierarchical clustering algorithm. That is, for each iteration of the algorithm, you need to show the found closest two clusters and the updated distance matrix M