Place all the data of Table 1 into a kd-tree. Assume two records can fit in one block. At each level, pick a separating value that divides the data as evenly as possible. For an order of the splitting attributes choose:

1. [5 points] Speed, then RAM, alternating; 2. [5 points] Speed, then RAM, then hard-disk, alternating.