Consider a hash function h(k) = k% 17 and a hash table of 17 buckets (b = 17) where each bucket can only keep one key (s = 1). Suppose there are n = 11 keys in total, i.e., {1, 3, 5, 17, 18, 19, 35, 10, 0, 38, 52}. Assume that linear probing is used. (1) Show the hash table after inserting all the keys. (2) Suppose we want to delete the key of 18 from the hash table built in (1). Can you just mark its bucket as empty? Justify your answer. If you cannot, give your solution to deal with this case