2. Consider the following three dimensional data points: X1 (1, 1, 1), X2 (4, 1.5, 2), X7 (1, 2, 1), X3 (2, 1, 1), X4 (2, 1.5, 1), X5 = (3, 2, 1), X6 (4, 2, 2), X8 = (5, 1.5, 2) Illustrate graph clustering using minimum spanning tree algonthm using the data points to form three clusters. Use Euclidian distance metric to compute the distance between the points. Show all steps and computations. List the final clusters along with the data points in each cluster.