Exercise $7\mathrm{.}2\mathrm{.}6$ Edit distance: The distance between two strings x $=$ x$1$x$2...$xn and y $=$ y$1$y$2...$ym is the smallest number of insertions and deletions of sin gle characters that will convert x to y$.$ For example, edit distance between abcde and acfdeg is $3.$ Consider the space of strings with edit distance as the distance measure. Give an example of a set of strings such that if we choose the clustroid by mini mizing the sum of the distances to the other points we get one point as the clustroid, but if we choose the clustroid by minimizing the maximum distance to the other points, another point becomes the clustroid.