Apply hierarchical clustering to the following data in a 2-diemnsional Euclidean space.

Assume stopping point is k = 2 (k is the number of clusters).

Provide all intermediate computations.

Note: You must use Manhattan Distance for this problem.

point a: (0, 2)

point b: (2, 0)

point c: (12, 10)

point d: (8, 8)