howeverif the slot is not empty and the key of the item is not the same as our current keythen we have collision this is where we need to figure out way to handle conflict we are going to do this by adding one to the previous hash value we had and getting the remainder of dividing this value by the size of the hash table this is linear way of resolving collisions and it is quite simplewhile self slots[his not noneif self slots[hkey is keybreak ( self size we have found our insertion point if this is new element (that isit contained none previously)then we increase the count by one finallywe insert the item into the list at the required positionif self slots[his noneself count + self slots[hitem getting elements the implementation of the get(method should return the value that corresponds to key we also have to decide what to do in the event that the key does not exist in the table we start by calculating the hash of the keydef get(selfkey) self _hash(key