Two relations A and B are stored as clustered sequential files on disk. Each block on disk can hold 100 records of either A or B. The relation A contains 1000 records and B contains 500 records. There is a memory buffer to hold only 1 block of each relation. The number of block transfers required to complete a nested loop join operation on these two tables is at least (in integer) _________.
