In this step, you limit your dataset only to the first $6$ rows of sepal widths and sepal length.

You are going to develop a Python code that uses the Agglomerative Hierarchical Clustering Algorithms, Euclidean Distance and Single Linkage $($minimum distance between two clusters to merge them$)$ to cluster above $6$ data records using dendrogram.

Here you are required to look at your data and try to understand them. You can assume sepal widths as $$x$$ and sepal length as $$y$$ coordinates. To start you can use scatterplot$()$ to draw each point. Then you are going to use your lecture on Hierarchical Clustering Algorithms to plot a dendrogram using Single Linkage to merge two closest clusters together. You must write a step by step algorithm for your specific Agglomerative Hierarchical Clustering with its associated flow chart. For each epoch your code must show:

Your calculations

Your cluster based on the updated distance matrix.

Your dendrogram progress and the new clusters in your dendrogram plot.