資料結構與演算法(A)

(5 points) 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$. Which data is the first one that occurs a collision?