Time complexity for insertion and search in B+ tree

Question

I am trying to test out the implementation of B+ tree against various values of m. All the resources say the time complexity of insert and search is O(logn) base m