Given the following 6 points in 3 dimensions: (1.1. 3), (2,1,2), (4,3,2), (5.4.2), (2.4.1). (10.10.1) perform k-means clustering algorithm of k=2 clusters with Manhattan distance for these 6 points. Use (1,1,3) (5,4,2) as the initial means. You must show steps until the results show no change between steps; guess work will gain no mark