Hi. I'm having hard time with this question right now. Can somebody show me step by step to get this answer?

Question 3 (15 marks) Consider the following 2-dimensional data set: A B C D E F 2 7 1 8 3 9 02 3 2 1 5 6 7 11 7 F 6 E 5 D 4 3 A 2 B 8 IC 2 3 4 5 6 7 9 Perform the first loop of the PAM algorithm (k = 2) using the Manhattan distance. Select D and E (highlighted in the plot) as initial medoids and compute the resulting medoids and clusters. Hint: When C(m) denotes the cluster of medoid m, and M denotes the set of medoids, then the total distance TD may be computed as TD = (m, ) MEM DEC(m)