1. Consider the K-Means algorithm constrained to group the given data into three clusters. The initial cluster assignment reads C1={p1,p2,p3},C2={p4,p5,p6}, and C3= {p7,p8}. You are supposed to iterate the algorithm until convergence and show each step until the final clustering. You may use the Manhattan distance to progress your algorithm