1a. Write pseudocode for a method hash_delete(table, x) that deletes an element from a hash table by placing a

tombstone del

void hash_delete(table, x){

}

1b. Modify hash_search(table, x) to handle the tombstone del

int hash_search(table, x){

}

1c. Hash the elements 1.34, 1.45, 2.56, 2.16, 5.12, 2.25 into a table size 7, named TABLE using hash function h(x) = [x]

1d. Trace through the steps of a call to hash delete(TABLE, 2.16)

1e. Trace through the steps of a call to hash search(TABLE, 2.25)