Question $1(3$ points$).$ Use the similarity matrix in the table below to perform complete link hierarchical clustering by hand $($do not use Python$).$ Show your results by drawing a dendrogram. The dendrogram should clearly show the order in which the points are merged.

$\backslash$table$[[,$p$1,$p$2,$p$3,$p$4,$p$5],[$p$1,1\mathrm{.}00,0\mathrm{.}10,0\mathrm{.}41,0\mathrm{.}55,0\mathrm{.}35],[$p$2,0\mathrm{.}10,1\mathrm{.}00,0\mathrm{.}64,0\mathrm{.}47,0\mathrm{.}98],[$p$3,0\mathrm{.}41,0\mathrm{.}64,1\mathrm{.}00,0\mathrm{.}44,0\mathrm{.}85],[$p$4,0\mathrm{.}55,0\mathrm{.}47,0\mathrm{.}44,1\mathrm{.}00,0\mathrm{.}76],[$p$5,0\mathrm{.}35,0\mathrm{.}98,0\mathrm{.}85,0\mathrm{.}76,1\mathrm{.}00]]$