Consider the set of points given in the following figure: 10 9 7 B 8 16 G 4 5 3 H H 2 1 0 01 2 3 4 5 67 8 9 10 Assume that eps = 2 and minpts = 3 (including the centre point). Using Euclidian Distance find all the density-based clusters in the figure using the DBSCAN algorithm. List the final clusters (with the points in lexicographic order, i.e., from A to J) and outliers.