We use $3$com to denote an operation that sorts $3$ numbers. Show that one needs at least log$6$n$!$ number of $3$com operations to sort n distinct numbers. You must write down your reasoning clearly.