What is the time complexity for deleting root key in a ternary heap of n elements?

(a) O (log n/ log 3)

(b) O (3log n/ log 3)

(c) O (n)

(d) O (1)

I need to ask this question from Ternary heap topic in portion Heap of Data Structures & Algorithms I

This question was posed to me in a job interview.