The worst case analysis for a naïve merge is given as?

(a) O(N)

(b) O( log N)

(c) O( N log N)

(d) O(N^2)

This interesting question is from Heap in portion Heap of Data Structures & Algorithms I

The question was posed to me during an online interview.