Click the Exhibit button.
These three Sequential Files shown in the exhibit need to be joined. Join_1 is on Columns CustID
and OrderID. Join_2 is on CustID and LocationID. What is the most efficient hash partitioning
strategy for each link?

A.
For LinkA Hash Partition on CustID;
For LinkB Hash Partition on CustID;
For LinkC Same Partition;
For LinkD Hash Partition on CustID.

B.
For LinkA Hash Partition on OrderID and CustID;
For LinkB Hash Partition on OrderID and CustID;
For LinkC Hash Partition on LocationID and CustID;
For LinkD Hash Partition on LocationID and CustID.

C.
For LinkA Hash Partition on CustID and OrderID;
For LinkB Hash Partition on CustID and OrderID;
For LinkC Hash Partition on CustID and LocationID;
For LinkD Hash Partition on CustID and LocationID.

D.
For LinkA Hash Partition on CustID,OrderID and LocationID;
For LinkB Hash Partition on CustID,OrderID and LocationID;
For LinkC Hash Partition on CustID,OrderID and LocationID;
For LinkD Hash Partition on CustID,OrderID and LocationID.

Explanation: