Suppose it takes the same amount of time for both HAC $($hierarchical agglomerative clustering$)$ and k$-$means clustering to identify $2$ clusters from a small collection $($e$.$g$.,$ of $10$ instances$).$ Which method will be faster $($take less time$)$ to identify $2$ clusters from a much larger collection $($e$.$g$.,$ of $1$ million instances$)?[]$