What is true about variable neighborhood function?

• A. neighbourhood functions that are sparse lead to quicker movement during search
• B. algorithm has to inspect very fewer neighbours
• C. vdn stars searching with sparse neighbourhood functions, when it reaches an optimum, it switches to denser function.
• D. all of the above