1. Perform the Hubs and authorities algorithm on graph G=({1,2,3,4}, {(1,2), (1,3), (3,2), (3,4), (4,1)})!

2. Perform hierarchical clustering over the data set consisting of data points [4 8.5; 4 10; 6 8; 7 10] such that clusters ara merged based on
a) the distance of the closest points between two clusters,
b) the average distance of clusters,
c) distance of the centroids representing the clusters.

3. Using Octave, perform hierarchical clustering using different (e.g. single/complete) linkage methods on the dataset [4 1; 3 7; 2 5; 8 6; 10 17]. Also perform k-means clustering on the same data when using k=2 and k=3 as well.