What is the run time efficiency of an insertion algorithm?

(a) O(N)

(b) O(log N)

(c) O(N^2)

(d) O(M log N)

My doubt stems from Heap topic in section Heap of Data Structures & Algorithms I

This question was addressed to me in my homework.