Consider eight data points. X1: (4, 5), x2: (5, 3), x3: (-7, -2), x4: (-2, 1), xs: (13, 15), x6: (11, 9), x7: (-5, -3), xs: (5, 4) Please use the agglomerative approach to find the dendrogram by using the median linkage as a distance measurement. Please write down the distances (in the x-axis) in the dendrogram. Please show each step of how you do the computation to know that the two (small) clusters are merged into one cluster in the agglomerative approach. You cannot use XLMiner in this question.