Select the correct order of the DBSCAN algorithm steps in detail.

A. For each point in the dataset, check if it is a core point by counting its neighbors within a specified radius.

B. For each unvisited core point, start a new cluster and add it to the current cluster list.

C. For every point in the cluster, find its density-reachable points and recursively add them to the current cluster.

D. Mark points that are not part of any cluster and do not meet the core point criteria as noise.

Choose the correct answer from the following: