Which of the following is not true about library sort?

• A. it uses binary search and insertion sort in its implementation
• B. gaps are created between successive elements in order to ensure faster insertion
• C. array needs to be re balanced after every insertion
• D. it is an in place sorting algorithm