4. For DBSCAN clustering method (density-based), consider the following figure and answer the questions, assuming that we use the Euclidean distance between points, and that 2 and minpr-3: 10 8 (7 /m id 12 3 4 5 6 7 89 10 11 12 13 14 15 16 17 (c) List all the core points (d) Is a directly density reachable from d? (e) is o density reachable from i? Show the intermediate points on the chain or th (1) Is density reachable a symmetric relationship, that is, if x is density reachable f (g) Is / density connected to x? Show the intermediate points that make them der (h) Show the density-based clusters and the outlier points (if there exists) point where the chain breaks y, does it imply that y is density reachable from x? Why or why not? connected or violate the property, respectively 4. For DBSCAN clustering method (density-based), consider the following figure and answer the questions, assuming that we use the Euclidean distance between points, and that 2 and minpr-3: 10 8 (7 /m id 12 3 4 5 6 7 89 10 11 12 13 14 15 16 17 (c) List all the core points (d) Is a directly density reachable from d? (e) is o density reachable from i? Show the intermediate points on the chain or th (1) Is density reachable a symmetric relationship, that is, if x is density reachable f (g) Is / density connected to x? Show the intermediate points that make them der (h) Show the density-based clusters and the outlier points (if there exists) point where the chain breaks y, does it imply that y is density reachable from x? Why or why not? connected or violate the property, respectively