What will be the time complexity of insertion operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)

• A. O(1)
• B. O(m)
• C. O(m²)
• D. O(log m)