Imagine your hash table bas 5 spots init Your hash function hashtankar milles on the number of letters in they. The hash function returns the length of key based in. For exa San The Index of each woment is determined by accounting for the number of spots in the array 33 ) 1 Using chaining, where will an element whose key is ophant placed in the hashta? Elephant cannot be placed in the hashtable because the hech table is not large enough tele Gave the following starter code in the missing lines of codes that the tree is traversed using the nerder method (The objectives simply to print out every rede in the correct order using this method) It tartorde inut) traversodestacters.it travessNode(cartellode.left ystem.out.printineatodeale