There are 10 hexadecimal data, 53, 3B, 66, 43, 60, 5B, 7C, 14, 30, 37, inserted in the given order into an empty hash table. The table is implemented using a circular array of 10 slots, and one slot can only have one item. The hash function for the table is $h(k) = k \bmod 9$ (以十六進位值計算).

(a) Which data is the first one that occurs a collision? (A) 43 (B) 5B (C) 14 (D) 37

(b) If the hash table uses linear probing to resolve collisions and has no resizing mechanism, which position in the array is 37 inserted? (A) 3 (B) 8 (C) 4 (D) 0