C$++$ Code, Hash Tables

int y$($x$,$ buckets$)\{$

int result $=0$;

while $($ x $!=0)\{$

$//$ Multiply the first and last digits of x and add it to result.

result $+=$ last$\_$digit$($x$)*$ first$\_$digit$($x$)$

x $=$ remove$\_$first$\_$and$\_$last$\_$digit$($x$)$

$\}$

return $($result mod buckets$)$

$\}$

What bucket will the key $12345678$ hash into, when the hash function is the y shown above and there are $100$ buckets?

Which one of the following hash functions distributes the following items $\{$Eetu$,$Kai$,$Nelli$,$Kaisa$,$Elias$\}$ most evenly, if there are $9$ buckets? $($Note$.$ All of the hash functions given are actually quite bad.$)$

a$)$ the first letter$$s running number in the alphabet mod $9.$

b$)$ the length of the key mod $9.$

c$)$ the first letter$$s running number in the alphabet multiplied by the length of the key mod $9.$