Please help me solve this algorithms problem, I will rate your answer!!

You have a hash table of size m= 11 and two hash functions hi and h2. Here are some precomputed hash values: word ape bat bird COW dog goat hare koala mule panda h1 6 5 2 0 5 5 5 0 1 2 2 0 2 6 4 1 3 3 8 h2 7 1- Draw a picture of the resulting hash-table after inserting the following words in order: dog, hare, ape, mule, bat, panda, cow, koala, goat 2- Identify cells that are probed when trying to find the word: bird. Do (1) and (2) using each of the following techniques: a. (25 points) Linear probing with h1 as your hash function. b. (25 points) Double hashing with hi as your first hash function and h2 as your second hash function