Why is Shell sort called as a generalization of Insertion sort?

• A. Shell sort allows an exchange of far items whereas insertion sort moves elements by one position
• B. Improved lower bound analysis
• C. Insertion is more efficient than any other algorithms
• D. Shell sort performs internal sorting