A hash table using chaining is initially empty. Then two items are inserted, $x$ and $Y,$ in that order $x$ does not equal $Y,$ but $x$ and $Y$ have the same hash Code. Which statement is true?

a$.x$ and $Y$ are inserted into the same bucket

b$.x$ and $Y$ are inserted into different buckets

c$.$ Insertion of $x$ succeeds but insertion of $Y$ fails

d$.$ Insertion of $Y$ overwrites $A$