（是非題）Assume each data access of a hard drive can fetch a "block" of K data, where K is usually a large number, say, 1024. If we store N (e.g. N = 10 millions) data in this hard drive using a B tree of order K, then the time to "find" a specific data from this hard drive is approximately $\log_K N * t$, where $t$ is the disk access time.