An empty hash table has a capacity of 103, and you insert six entries with keys 103, 0, 205, 308, 411, and 2.

Using linear probing and a division hash function, where will these entries be placed in the table?

For example to answer the question for entry 103:

103 at [0] (i.e., [0] is location of entry 103)