Still assume that the two relations R and S were hash-partitioned on two different attributes over four Nodes (Node 1 to Node 4), and that R is about 1/100th of the size of S. Choose one distributed join strategy for this question, and state which one you have chosen (typically the same than in the previous question). For this algorithm and scenario, what data is sent between each pair of nodes? Justify your answer by stating how many R partitions have to be exchanged between nodes, and also stating how many S partitions have to be exchanged.