i) customer(customer_Number, name, phone, address) ii) fransaction(transaction ID date, amount, customer_Number) The customer_Number" is the key for the customer relation, and transaction_ID" is the key for the transaction relation. The transaction.customer_Number is the foreign key referencing the customer relation. The customer relation has 5,000 tuples stored in 500 blocks, and the transaction relation contains 80,000 tuples stored in 7,000 blocks. Assume that the relation transaction has been sequentially sorted by the key attribute. Answer the following questions. Assume that the hash join algorithm is used to evaluate "customer transaction", the number of partitions, nin=30, and the size of the buffer for reading and writing, bo=3. How many block transfers are needed? How many seeks are needed