We have a relation R which has 100,000 ordered tuples of 230 bytes each, stored on 10,000 consecutive disk blocks of size B=2400 bytes (10 tuples per block). Suppose the average seek time is 16 ms, average rotational delay is 8.3 ms, and block transfer time (btt) is 0.8 ms. The task is to search for k independent random tuples in R. To do this, we could either perform k random block reads or perform an exhaustive read of the entire relation R. Determine for which value of k, the second method (exhaustive read) would be faster than the k random reads.