Which statement about Insertion Sort is correct?

A. rank approximates tree height B. its merge step usually needs auxiliary storage for arrays C. it is adaptive to existing order D. edges may be directed or undirected