What is the time complexity for inserting a new item in a ternary heap of n elements?

(a) O (log n/ log 3)

(b) O (n!)

(c) O (n)

(d) O (1)

The query is from Ternary heap in portion Heap of Data Structures & Algorithms I

I got this question in final exam.