A hash set of integers uses the "mod" hash function linear probing for collision resolution.

The initial hash table length is $7.$ If the load factor is $80\%$ or higher, rehash by doubling the

hash table size. The below elements are added and$/$or removed. Draw the entire array and the

contents of each array index. Write an $"x"$ in any index position where an element is

removed and not replaced by another element. What is the load factor of the final table?

Show the table elements after every addition $/$ removal.

Add $5$ ; Add $52$ ; Add $50$ ; Add $39$ ; Add $29$ ; Remove $5$ ; Add $70$ ; Add $92$ ; Remove $52$ ;

Add $15$ ; Add $18$