show that n insertions in a 2-3 tree can be done in order O(n)

Question

I have to probe that n insertions in a 2-3 tree can be done in order O(n). I know that one insertion in the worst case is O(log2(n)), but what happens when I try n insertions...

I don't know what to do, help