Suppose that the keys A through H have the following hash values: key ABCDEFGHI hash value 5 6 0 85 6 78 9 Now suppose that the following table results from inserting these keys into an initially empty table using hashing with linear probing C H I D E AFG B Choose the answers below that best describe keys A through D: B MUST have been the last key inserted A MUST have been the LAST key inserted A, B, and C MUST have been inserted BEFORE H D MUST have been the LAST key inserted B MUST have been inserted after H O C COULD have been the first key inserted D MUST have been inserted AFTER O B, C, and D MUST have been inserted BEFORE H