hashing mechanisms and collision handling using probing. Here are the correct statements based on the information provided:Linear hashing may result in secondary clustering: This is true. Linear probing can lead to secondary clustering, where a cluster of filled slots forms, causing subsequent insertions to probe through the same cluster$1.$Records are stored as a linked list: This is false. In probing methods like linear or quadratic probing, records are stored directly in the hash table, not as a linked list$2.$Deleting is not possible when we use probing: This is false. Deletion is possible in probing methods, but it requires marking the slot as deleted rather than simply removing the entry$1.$Quadratic hashing eliminates primary clustering: This is true. Quadratic probing helps to eliminate primary clustering by using a quadratic function to determine the probe sequence$1.$