Update K_Means_Clustering_Practice.ipynb

Author: tirthajyoti

K_Means_Clustering_Practice.ipynb

@@ -29,7 +29,7 @@
     "\n",
     "This algorithm is guaranteed to converge to a result. The result may be a local optimum (i.e. not necessarily the best possible outcome), meaning that assessing more than one run of the algorithm with randomized starting centroids may give a better outcome.\n",
     "\n",
-    "<img src=https://upload.wikimedia.org/wikipedia/commons/e/ea/K-means_convergence.gif style=\"width: 500px;\">\n",
+    "<img src=https://upload.wikimedia.org/wikipedia/commons/e/ea/K-means_convergence.gif style=\"width: 500px;\"/>\n",
     "\n",
     "## The Data\n",
     "\n",