Java problem.

*NOTE*: DO NOT POST A CODE ANSWER PLEASE. Thanks.

Insert the following data sequence into the open addressing hash-table below. Use linear probing to remedy collisions. The hash-function H is: H(key-round(key) % 7 Data: 3.9, 11.1, 8.0, 5.9, 42.0, 4.2 How many collisions occurred during the insertion of the value 4.2? How many probes are done when inserting the value 4.2