Consider figure below. Answer the following questions related to DBSCAN. Assume that we use the Euclidean distance between points in DBSCAN, and that radius is eps = 2 and threshold for a point to be in the core is to have at least minpts = 3 neighbors within the radius. 1. List all the core points. 2. We say that a point x is directly density reachable from another pointy, if x belongs to the neighborhood Neps (y) (i.e. in the ball of eps-radius around y) and y is a core point. Is a directly density-reachable from d? 3. We say that x is density reachable from y if there is a chain of points x = C₁,..., Ck = y such that c is directly reachable from c-1 for all i. Is density-reachable a symmetric relationship, i.e., if x is density-reachable from y, does it imply that y is density-reachable from x? Why or why not? 4. Is n density-reachable from e? Show the intermediate data points on the chain or the point where the chain breaks 5. Show the density-based clusters and the noise points 10 9 8 7 6 5 4 3 2 6 2 h た 1 E H fg m 3 4567 8 9 10 11 12 13 14 15 16 17